Trisnawati, Melly (2010) IMPLEMENTATION DFS ALGORITHM IN AN ORDINARY PIPE GAME. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

Preview	Text (COVER) 04.02.0066 Melly Trisnawati COVER.pdf Download (518kB) | Preview
	Text (BAB I) 04.02.0066 Melly Trisnawati BAB I.pdf Restricted to Registered users only Download (560kB)
	Text (BAB II available document only in library of Soegijapranata Catholic University) 04.02.0066 Melly Trisnawati BAB II.pdf Restricted to Repository staff only Download (578kB)
	Text (BAB III available document only in library of Soegijapranata Catholic University) 04.02.0066 Melly Trisnawati BAB III.pdf Restricted to Repository staff only Download (562kB)
	Text (BAB IV available document only in library of Soegijapranata Catholic University) 04.02.0066 Melly Trisnawati BAB IV.pdf Restricted to Repository staff only Download (569kB)
	Text (BAB V available document only in library of Soegijapranata Catholic University) 04.02.0066 Melly Trisnawati BAB V.pdf Restricted to Repository staff only Download (566kB)
	Text (BAB VI) 04.02.0066 Melly Trisnawati BAB VI.pdf Restricted to Repository staff only Download (558kB)
Preview	Text (DAFTAR PUSTAKA) 04.02.0066 Melly Trisnawati DAFTAR PUSTAKA.pdf Download (557kB) | Preview

Abstract

This Pipe game is played by two players. User as first player and computer as second player. User’s work is to put down where start, wall, and finish into available board. After that computer pair where some pipes can be put down. Those pipes are paired into board so that can connect between start and finish. This project was made with Java language and using tree as data structure. Shortest distance from pipes’s network where is formed and it’s the best pipes’s network connective between start and finish can searched by using DFS(Depth First Search) algorithm.

Actions (login required)

View Item