Daftar Isi: OTHELLO With Minimax Algorithm

Main Author:	Santoso, Denny
Format:	Thesis NonPeerReviewed Book
Bahasa:	eng
Terbitan:	, 2009
Subjects:	Data processing & computer science
Online Access:	http://repository.unika.ac.id/7460/1/05.02.0006%20Denny%20Santoso%20COVER.pdf http://repository.unika.ac.id/7460/2/05.02.0006%20Denny%20Santoso%20BAB%20I.pdf http://repository.unika.ac.id/7460/3/05.02.0006%20Denny%20Santoso%20BAB%20II.pdf http://repository.unika.ac.id/7460/4/05.02.0006%20Denny%20Santoso%20BAB%20III.pdf http://repository.unika.ac.id/7460/5/05.02.0006%20Denny%20Santoso%20BAB%20IV.pdf http://repository.unika.ac.id/7460/6/05.02.0006%20Denny%20Santoso%20BAB%20V.pdf http://repository.unika.ac.id/7460/7/05.02.0006%20Denny%20Santoso%20BAB%20VI.pdf http://repository.unika.ac.id/7460/8/05.02.0006%20Denny%20Santoso%20DAFTAR%20PUSTAKA.pdf http://repository.unika.ac.id/7460/

Daftar Isi:

Othello Game is traditional game from Japan. This game has a board with size 8 x 8 and need 2 player. Each of player has different seed, the color of one is white and another is black. regulation from game othello is the each player try to change the seed colour as much as possible to reach the highest value. If in side seed which we play there are enemy seed or on the contrary, so that we can change it either through vertical, horizontal and also diagonal. This project created with Java programming and GUI programming. This project use Array 2 dimension and Tree as a data structure to store data. This project use Minimax as an algorithm for searching all data.