Daftar Isi: Implementation BFS on Maze Games

Main Author:	Prayoga, Heru
Format:	Thesis NonPeerReviewed Book
Bahasa:	eng
Terbitan:	, 2009
Subjects:	000 Computer Science Information and General Works
Online Access:	http://repository.unika.ac.id/7461/1/04.02.0036%20Heru%20Prayoga%20COVER.pdf http://repository.unika.ac.id/7461/2/04.02.0036%20Heru%20Prayoga%20BAB%20I.pdf http://repository.unika.ac.id/7461/3/04.02.0036%20Heru%20Prayoga%20BAB%20II.pdf http://repository.unika.ac.id/7461/4/04.02.0036%20Heru%20Prayoga%20BAB%20III.pdf http://repository.unika.ac.id/7461/5/04.02.0036%20Heru%20Prayoga%20BAB%20IV.pdf http://repository.unika.ac.id/7461/6/04.02.0036%20Heru%20Prayoga%20BAB%20V.pdf http://repository.unika.ac.id/7461/7/04.02.0036%20Heru%20Prayoga%20BAB%20VI.pdf http://repository.unika.ac.id/7461/8/04.02.0036%20Heru%20Prayoga%20DAFTAR%20PUSTAKA.pdf http://repository.unika.ac.id/7461/

Daftar Isi:

Game Maze is a game with aim to to look for way out which have been determined by user and at this game there are barrier in the form of wall, so that for trouble-shooting will look for its solution by computer. For trouble-shooting, in this game use algorithm of Breath First Search, array 2 dimension and tree data structure. So that in this game can finding the goals with an optimal although there are have many kinds of problem of seeking at game maze. End result of the seeking can be concluded by seeking of optimal band to pass to find goals which have is determined.and will present result of from the conclusion with Grapichal User Interface.