Implementation Array List And Uniform Cost Search Algorithm In X-O Game

Suhartono, Ardilles Irawan (2009) Implementation Array List And Uniform Cost Search Algorithm In X-O Game. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

Preview	Text (COVER) 05.02.0008 Ardilles Irawan Suhartono COVER.pdf Download (330kB) | Preview
	Text (BAB I) 05.02.0008 Ardilles Irawan Suhartono BAB I.pdf Restricted to Registered users only Download (32kB)
	Text (BAB II available document only in library of Soegijapranata Catholic University) 05.02.0008 Ardilles Irawan Suhartono BAB II.pdf Restricted to Repository staff only Download (62kB)
	Text (BAB III available document only in library of Soegijapranata Catholic University) 05.02.0008 Ardilles Irawan Suhartono BAB III.pdf Restricted to Repository staff only Download (37kB)
	Text (BAB IV available document only in library of Soegijapranata Catholic University) 05.02.0008 Ardilles Irawan Suhartono BAB IV.pdf Restricted to Repository staff only Download (72kB)
	Text (BAB V available document only in library of Soegijapranata Catholic University) 05.02.0008 Ardilles Irawan Suhartono BAB V.pdf Restricted to Repository staff only Download (162kB)
	Text (BAB VI) 05.02.0008 Ardilles Irawan Suhartono BAB VI.pdf Restricted to Registered users only Download (32kB)
Preview	Text (DAFTAR PUSTAKA) 05.02.0008 Ardilles Irawan Suhartono DAFTAR PUSTAKA.pdf Download (31kB) | Preview

Abstract

X-O game is the game which train our accuracy on blockade the way of our opponent and find the way for us to win this game. One player play with O as human player and the other play with X as computer player. The winner of this game is player who the first reach the 5 block. To reach the 5 block can be horizontal, vertical and cross. This game is not limited by the time. The computer use UCS (Uniform Cost Search) algorithm to find biggest point and decide which appropriate coordiante to move. This project created with Java programming and GUI programming. This project use Array List as a data structure to store data. This project use UCS as an algorithm for searching all data and decide computer movement. This data structure and algorithm make a simple and short in time to searching next move and blokade the user movement.

Item Type:	Thesis (Other)
Subjects:	000 Computer Science, Information and General Works > 005 Computer programming, programs & data
Divisions:	Faculty of Computer Science
Depositing User:	Mr Ign. Setya Dwiana
Date Deposited:	27 Jan 2016 02:18
Last Modified:	27 Jan 2016 02:18
URI:	http://repository.unika.ac.id/id/eprint/7462

Actions (login required)

View Item