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/
ctrlnum 19199
fullrecord <?xml version="1.0"?> <dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><relation>http://eprints.umm.ac.id/19199/</relation><title>PERANCANGAN PERMAINAN CATUR 3D SEDERHANA DENGAN PENERAPAN ALGORITMA MINIMAX DALAM BAHASA PEMROGRAMAN JAVA</title><creator>NUGROHO, ABDILLAH WAKHID</creator><subject>TA Engineering (General). Civil engineering (General)</subject><description>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.&#xD; 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.</description><date>2012-09-24</date><type>Thesis:Thesis</type><type>PeerReview:NonPeerReviewed</type><identifier> NUGROHO, ABDILLAH WAKHID (2012) PERANCANGAN PERMAINAN CATUR 3D SEDERHANA DENGAN PENERAPAN ALGORITMA MINIMAX DALAM BAHASA PEMROGRAMAN JAVA. Other thesis, University of Muhammadiyah Malang. </identifier><recordID>19199</recordID></dc>
format Thesis:Thesis
Thesis
PeerReview:NonPeerReviewed
PeerReview
author NUGROHO, ABDILLAH WAKHID
title PERANCANGAN PERMAINAN CATUR 3D SEDERHANA DENGAN PENERAPAN ALGORITMA MINIMAX DALAM BAHASA PEMROGRAMAN JAVA
publishDate 2012
topic TA Engineering (General). Civil engineering (General)
url http://eprints.umm.ac.id/19199/
contents 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.
id IOS4109.19199
institution Universitas Muhammadiyah Malang
institution_id 136
institution_type library:university
library
library Perpustakaan Universitas Muhammadiyah Malang
library_id 546
collection UMM Institutional Repository
repository_id 4109
city MALANG
province JAWA TIMUR
repoId IOS4109
first_indexed 2017-03-21T02:44:29Z
last_indexed 2017-03-21T02:44:29Z
recordtype dc
_version_ 1675924234162929664
score 17.538404