Implementation Minimax Algorithm in Mini Chess Game
| ctrlnum |
7527 |
|---|---|
| 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://repository.unika.ac.id/7527/</relation><title>Implementation Minimax Algorithm in
Mini Chess Game</title><creator>Moses, De Rosal Ign</creator><subject>Data processing & computer science</subject><description>This game is a simple mini game of chess where there are only seven pieces
for each color of a horse, a minister, and five pawns. Where the horse is also
regarded as the king / hero in this game if the horse dies then the game ends.
Horses and ministers are also to protect the pawn berugas because if all the
pieces off the game also ends. To rule this game similar to chess in general
only slightly different seliain rules of pawn and pawn end game can only
walk 1 step when you first walk. Because of this game versus a game and a
little sharpen the brain, then this game using the Minimax algorithm, a tree
data structure.</description><date>2009</date><type>Thesis:Thesis</type><type>PeerReview:NonPeerReviewed</type><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7527/1/06.02.0012%20De%20Rosal%20Ign%20Moses%20S%20COVER.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7527/2/06.02.0012%20De%20Rosal%20Ign%20Moses%20S%20BAB%20I.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7527/3/06.02.0012%20De%20Rosal%20Ign%20Moses%20S%20BAB%20II.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7527/4/06.02.0012%20De%20Rosal%20Ign%20Moses%20S%20BAB%20III.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7527/6/06.02.0012%20De%20Rosal%20Ign%20Moses%20S%20BAB%20IV.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7527/5/06.02.0012%20De%20Rosal%20Ign%20Moses%20S%20BAB%20V.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7527/7/06.02.0012%20De%20Rosal%20Ign%20Moses%20S%20BAB%20VI.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7527/8/06.02.0012%20De%20Rosal%20Ign%20Moses%20S%20DAFTAR%20PUSTAKA.pdf</identifier><identifier> Moses, De Rosal Ign (2009) Implementation Minimax Algorithm in Mini Chess Game. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata. </identifier><recordID>7527</recordID></dc>
|
| language |
eng |
| format |
Thesis:Thesis Thesis PeerReview:NonPeerReviewed PeerReview Book:Book Book |
| author |
Moses, De Rosal Ign |
| title |
Implementation Minimax Algorithm in
Mini Chess Game |
| publishDate |
2009 |
| topic |
Data processing & computer science |
| url |
http://repository.unika.ac.id/7527/1/06.02.0012%20De%20Rosal%20Ign%20Moses%20S%20COVER.pdf http://repository.unika.ac.id/7527/2/06.02.0012%20De%20Rosal%20Ign%20Moses%20S%20BAB%20I.pdf http://repository.unika.ac.id/7527/3/06.02.0012%20De%20Rosal%20Ign%20Moses%20S%20BAB%20II.pdf http://repository.unika.ac.id/7527/4/06.02.0012%20De%20Rosal%20Ign%20Moses%20S%20BAB%20III.pdf http://repository.unika.ac.id/7527/6/06.02.0012%20De%20Rosal%20Ign%20Moses%20S%20BAB%20IV.pdf http://repository.unika.ac.id/7527/5/06.02.0012%20De%20Rosal%20Ign%20Moses%20S%20BAB%20V.pdf http://repository.unika.ac.id/7527/7/06.02.0012%20De%20Rosal%20Ign%20Moses%20S%20BAB%20VI.pdf http://repository.unika.ac.id/7527/8/06.02.0012%20De%20Rosal%20Ign%20Moses%20S%20DAFTAR%20PUSTAKA.pdf http://repository.unika.ac.id/7527/ |
| contents |
This game is a simple mini game of chess where there are only seven pieces
for each color of a horse, a minister, and five pawns. Where the horse is also
regarded as the king / hero in this game if the horse dies then the game ends.
Horses and ministers are also to protect the pawn berugas because if all the
pieces off the game also ends. To rule this game similar to chess in general
only slightly different seliain rules of pawn and pawn end game can only
walk 1 step when you first walk. Because of this game versus a game and a
little sharpen the brain, then this game using the Minimax algorithm, a tree
data structure. |
| id |
IOS2679.7527 |
| institution |
Universitas Katolik Soegijapranata |
| institution_id |
334 |
| institution_type |
library:university library |
| library |
Perpustakaan Universitas Katolik Soegijapranata |
| library_id |
522 |
| collection |
Unika Repository |
| repository_id |
2679 |
| subject_area |
Akuntansi Arsitektur Ekonomi |
| city |
SEMARANG |
| province |
JAWA TENGAH |
| repoId |
IOS2679 |
| first_indexed |
2017-02-25T15:02:35Z |
| last_indexed |
2017-02-25T15:02:35Z |
| recordtype |
dc |
| _version_ |
1765771673363021824 |
| score |
17.538404 |