Penerapan Algoritma Minimax pada Game Tic Tac Toe

Pamungkas, Ramadhana Wahid Aji and , Husni Thamrin, S.T, M.T, Ph.D (2023) Penerapan Algoritma Minimax pada Game Tic Tac Toe. Skripsi thesis, Universitas Muhammadiyah Surakarta.

	PDF (Naskah Publikasi) Naskah_Publikasi.pdf Download (768kB)
	PDF (Surat Pernyataan Publikasi) Surat_Pernyataan_Publikasi.pdf Restricted to Repository staff only Download (232kB)

Abstract

Algorithm minimax is the algorithm used to make choices by minimizing the possibility of losing the maximum value, this can mean that the possibility of losing will be minimized and wins will be maximized. Algorithm minimax can be applied in game board game based board so that computers will think like humans and have artificial intelligence, like tic tac toe, chess,othello, etc.Game board/board to which the algorithm will be applied minimax this is tic tac toe 4 x 4. The advantages of implementing the algorithm minimax is being able to analyze all possible positions of the game board/board to produce the best decision/maximum value because the minimax algorithm works recursively by looking for steps that will make the opponent experience the minimum loss.Game will be more exciting and more challenging if artificial intelligence is applied through algorithms minimax this and use languagePython through the modulePygame. In this researchGame tic tac toe will be designed with 3 modes, namely human vs human, human vs computer chooses automatically random, and humans vs computer applied algorithm minimax. The result of applying the algorithm minimax on game tic tac toe 4 x 4 which was tested using the moduletime.perf_counter( ) not effective because it takes a very long time to produce 12 empty boxes, it takes up to 3 hours, not yet 15 empty boxes, it must be longer because of the algorithm minimax check all the possibilities on the game board/board, in contrast to the application of the algorithm minimax ontic tac toe 3 x 3 for 9 empty squares results in a fast time of 6 seconds for the computer to choose the best move, it can be concluded that the algorithm minimax depending on the number of game boards /board.

Item Type:	Thesis (Skripsi)
Uncontrolled Keywords:	minimax, kecerdasan buatan, tic tac toe, board, python
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science > QA751 Artificial Intelligence Q Science > QA Mathematics > QA75 Electronic computers. Computer science > QA752 Information Technology
Divisions:	Fakultas Ilmu Komunikasi dan Informatika > Teknik Informatika
Depositing User:	RAMADHANA WAHID AJI P
Date Deposited:	23 May 2023 06:43
Last Modified:	23 May 2023 06:43
URI:	http://eprints.ums.ac.id/id/eprint/112603

Actions (login required)

View Item