PERANCANGAN PERMAINAN CATUR 3D SEDERHANA DENGAN PENERAPAN ALGORITMA MINIMAX DALAM BAHASA PEMROGRAMAN JAVA
| Main Author: | NUGROHO, ABDILLAH WAKHID |
|---|---|
| Format: | Thesis NonPeerReviewed |
| Terbitan: |
, 2012
|
| Subjects: | |
| Online Access: |
http://eprints.umm.ac.id/19199/ |
Daftar Isi:
- In designing computer chess, the necessary aspects such as data structure, move generator, evaluation function and the minimax algorithm. Data structure is how to represent a chess board position and arrangement of the objects into the application / program. Move the generator is used to describe the rules of the steps in chess pawns. Evaluation function to evaluate how good or how bad of a board position and deliver value more or less the same. And the minimax algorithm as a method of decision-making to get the best value. This study will discuss the application of minimax algorithms in computer chess. The core of this algorithm is where players fight to get the maximum value, while the computer struggling to get the minimum value. With the implementation of this algorithm, all possible steps in chess analyzed so that decisions can best be achieved with a relatively fast time corresponding number of possibilities and depth of the level is read. And from the test results are known on average computation time taken is 0.99 seconds in the 10 samples step-level games and the depth used is 2 levels.