Implementation DFS Algorithm In Snake Game To Find The Longest Path

Prabandini, Indiahgama (2009) Implementation DFS Algorithm In Snake Game To Find The Longest Path. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

Preview	Text (COVER) 05.02.0055 Indiahgama Prabandini COVER.pdf Download (91kB) | Preview
	Text (BAB I) 05.02.0055 Indiahgama Prabandini BAB I.pdf Restricted to Registered users only Download (33kB)
	Text (BAB II available document only in library of Soegijapranata Catholic University) 05.02.0055 Indiahgama Prabandini BAB II.pdf Restricted to Repository staff only Download (115kB)
	Text (BAB III available document only in library of Soegijapranata Catholic University) 05.02.0055 Indiahgama Prabandini BAB III.pdf Restricted to Repository staff only Download (41kB)
	Text (BAB IV available document only in library of Soegijapranata Catholic University) 05.02.0055 Indiahgama Prabandini BAB IV.pdf Restricted to Repository staff only Download (443kB)
	Text (BAB V available document only in library of Soegijapranata Catholic University) 05.02.0055 Indiahgama Prabandini BAB V.pdf Restricted to Repository staff only Download (265kB)
	Text (BAB VI) 05.02.0055 Indiahgama Prabandini BAB VI.pdf Restricted to Registered users only Download (33kB)
Preview	Text (DAFTAR PUSTAKA) 05.02.0055 Indiahgama Prabandini DAFTAR PUSTAKA.pdf Download (55kB) | Preview

Abstract

Snake Game is simple game, but in this project, Snake Game has modification where the snake can spend the way as much as possible and the same way can be acrossed maximal one more again. Snake and wall will holdered in every place in board by user. This project using tree to moving of snake while finding the longest path. Implementation in tree, this project has four children, it will search from up, right, down, and then left. All the tree will created also doing searching the longest path of way that can be across by snake. Tree as Data Structure and DFS algorithm can solve this project. Because the pursuit of DFS in here is to find the longest path that can be acrossed by snake . From the position of snake, doing process of search, if not found wall and not out size of board, snake will move to spend the way as much as possible while not blump wall and not acrossing the same way more of twice. If the longest path found, the game will finish.

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:14
Last Modified:	27 Jan 2016 02:14
URI:	http://repository.unika.ac.id/id/eprint/7498

Actions (login required)

View Item