Implementation Minimax Algorithm in Mummy Maze Game

Setiawan, Adrian Ricky (2009) Implementation Minimax Algorithm in Mummy Maze Game. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

Preview	Text (COVER) 05.02.0034 Adrian Ricky Setiawan COVER.pdf Download (329kB) | Preview
	Text (BAB I) 05.02.0034 Adrian Ricky Setiawan BAB I.pdf Restricted to Registered users only Download (32kB)
	Text (BAB II available document only in library of Soegijapranata Catholic University) 05.02.0034 Adrian Ricky Setiawan BAB II.pdf Restricted to Repository staff only Download (53kB)
	Text (BAB III available document only in library of Soegijapranata Catholic University) 05.02.0034 Adrian Ricky Setiawan BAB III.pdf Restricted to Repository staff only Download (37kB)
	Text (BAB IV available document only in library of Soegijapranata Catholic University) 05.02.0034 Adrian Ricky Setiawan BAB IV.pdf Restricted to Repository staff only Download (90kB)
	Text (BAB V available document only in library of Soegijapranata Catholic University) 05.02.0034 Adrian Ricky Setiawan BAB V.pdf Restricted to Repository staff only Download (276kB)
	Text (BAB VI) 05.02.0034 Adrian Ricky Setiawan BAB VI.pdf Restricted to Registered users only Download (31kB)
Preview	Text (DAFTAR PUSTAKA) 05.02.0034 Adrian Ricky Setiawan DAFTAR PUSTAKA.pdf Download (31kB) | Preview

Abstract

In the globalization era like now, the computer growth is very significant. Many software have been developed. The computer game become very popular. There is many type of game, such as strategy, RPG (Role Playing Game) , puzzle, and many more. One of the popular game is mummy maze. At mummy maze game, we are challenged to think where is the best way for the explorer to move without caught by the mummy that walk twice faster than the explorer. In this game, user can place the explorer, mummy, finish, and wall on the board. Then user can see how computer solve the problem. It use Tree as the data structure and minimax as the algorithm. The tree will make the possible path for the explorer, and the score from minimax algorithm will choose one best path that possible. The concept from the scoring is it is more important to count the distance from explorer to finish first rather than the distance from explorer to mummy. Because the main objective from this game is how to explorer reach the finish, not how to the explorer avoid the mummy. It is true the explorer must calculate the distance from the mummy, but still the distance from explorer to finish is more important. So the score from explorer to finish is bigger than explorer to mummy.

Item Type:	Thesis (Other)
Subjects:	000 Computer Science, Information and General Works > 004 Data processing & computer science
Divisions:	Faculty of Computer Science
Depositing User:	Mr Ign. Setya Dwiana
Date Deposited:	27 Jan 2016 02:15
Last Modified:	27 Jan 2016 02:15
URI:	http://repository.unika.ac.id/id/eprint/7494

Actions (login required)

View Item