Implementation Minimax Algorithm in Mini Pacman Game

Wijaya, Yessica (2009) Implementation Minimax Algorithm in Mini Pacman Game. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

Preview	Text (COVER) 06.02.0011 Yessica Wijaya COVER.pdf Download (126kB) | Preview
	Text (BAB I) 06.02.0011 Yessica Wijaya BAB I.pdf Restricted to Registered users only Download (110kB)
	Text (BAB II available document only in library of Soegijapranata Catholic University) 06.02.0011 Yessica Wijaya BAB II.pdf Restricted to Repository staff only Download (216kB)
	Text (BAB III available document only in library of Soegijapranata Catholic University) 06.02.0011 Yessica Wijaya BAB III.pdf Restricted to Repository staff only Download (38kB)
	Text (BAB IV available document only in library of Soegijapranata Catholic University) 06.02.0011 Yessica Wijaya BAB IV.pdf Restricted to Repository staff only Download (253kB)
	Text (BAB V available document only in library of Soegijapranata Catholic University) 06.02.0011 Yessica Wijaya BAB V.pdf Restricted to Repository staff only Download (354kB)
	Text (BAB VI) 06.02.0011 Yessica Wijaya BAB VI.pdf Restricted to Registered users only Download (33kB)
Preview	Text (DAFTAR PUSTAKA) 06.02.0011 Yessica Wijaya DAFTAR PUSTAKA.pdf Download (33kB) | Preview

Abstract

This game is an simple game that consists of a wall as an obstacle, pacman will we play, and the enemy played by computer. Players will place a wall as an obstacle to giving trouble to avoid the enemy in the catchment of the pacman. In this case, the computer is required for the safe step to avoid being caught by the pacman. Existing problems in this project is how to run a computer using AI enemy to enemy can always avoid the Pacman. The minimax algorithm is a specialized search algorithm which returns the optimal sequence of moves for a player in an zero-sum game. This game using Minimax Algorithm to search for a safe step. The possibilities of such step by using tree data structure. By using this algorithm, we can get a safe step calculated by finding the maximum value from every step of the way assessment. By using this Minimax algorithm, we can overcome the existing problems in this project. This happens because the Minimax algorithm also considers the possibility of the enemy's steps so that the final result is obtained the best result. The results can be seen clearly by looking at the AI's ability to always avoid the steps of the user not to get caught.

Item Type:	Thesis (Other)
Subjects:	000 Computer Science, Information and General Works > 005 Computer programming, programs & data
Divisions:	Faculty of Computer Science
Depositing User:	Mr Ign. Setya Dwiana
Date Deposited:	27 Jan 2016 02:13
Last Modified:	27 Jan 2016 02:13
URI:	http://repository.unika.ac.id/id/eprint/7525

Actions (login required)

View Item