Implementation of DFS Algorithm In Horse-Games

Saputro, Adi (2009) Implementation of DFS Algorithm In Horse-Games. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

Preview	Text (COVER) 05.02.0021 Adi Saputro COVER.pdf Download (106kB) | Preview
	Text (BAB I) 05.02.0021 Adi Saputro BAB I.pdf Restricted to Registered users only Download (33kB)
	Text (BAB II available document only in library of Soegijapranata Catholic University) 05.02.0021 Adi Saputro BAB II.pdf Restricted to Repository staff only Download (64kB)
	Text (BAB III available document only in library of Soegijapranata Catholic University) 05.02.0021 Adi Saputro BAB III.pdf Restricted to Repository staff only Download (37kB)
	Text (BAB IV available document only in library of Soegijapranata Catholic University) 05.02.0021 Adi Saputro BAB IV.pdf Restricted to Repository staff only Download (41kB)
	Text (BAB V available document only in library of Soegijapranata Catholic University) 05.02.0021 Adi Saputro BAB V.pdf Restricted to Repository staff only Download (651kB)
	Text (BAB VI) 05.02.0021 Adi Saputro BAB VI.pdf Restricted to Registered users only Download (32kB)
Preview	Text (DAFTAR PUSTAKA) 05.02.0021 Adi Saputro DAFTAR PUSTAKA.pdf Download (31kB) | Preview

Abstract

Horse goes to stable game is a game where computer can find best solution for discover stable as the finish. In this game, user only put the object that they interest. The object contains horse and finish. Where horse must go through entire finish. This game won if horse can go to finish. This game failed if horse can’t go through finish. The game is played on board, default board consisting of 25 squares: five rows and five columns. User can configure the game board like what they want.This board like globe that could go over the world. This project will be created with java language programming.Tree as data structure and DFS algorithm is the best solution can solve this project. Tree to spell out best way possibility and DFS algorithm to finding the best way. Use Tree as data structure because in tree we can get complex horse step and with DFS algorithm to finding the best way from this tree.

Item Type:	Thesis (Other)
Subjects:	000 Computer Science, Information and General Works > 004 Data processing & computer science
Divisions:	Faculty of Computer Science
Depositing User:	Mr Ign. Setya Dwiana
Date Deposited:	27 Jan 2016 02:15
Last Modified:	27 Jan 2016 02:15
URI:	http://repository.unika.ac.id/id/eprint/7489

Actions (login required)

View Item