Implementation Backtracking Algorithm, and Tree in Mouse Trap Maze Game

Ivan, Albert Agung (2010) Implementation Backtracking Algorithm, and Tree in Mouse Trap Maze Game. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

[img]
Preview
Text (COVER)
06.02.0008 Albert Agung Ivan H COVER.pdf

Download (175kB) | Preview
[img] Text (BAB I)
06.02.0008 Albert Agung Ivan H BAB I.pdf
Restricted to Registered users only

Download (84kB)
[img] Text (BAB II available document only in library of Soegijapranata Catholic University)
06.02.0008 Albert Agung Ivan H BAB II.pdf
Restricted to Repository staff only

Download (96kB)
[img] Text (BAB III available document only in library of Soegijapranata Catholic University)
06.02.0008 Albert Agung Ivan H BAB III.pdf
Restricted to Repository staff only

Download (95kB)
[img] Text (BAB IV available document only in library of Soegijapranata Catholic University)
06.02.0008 Albert Agung Ivan H BAB IV.pdf
Restricted to Repository staff only

Download (115kB)
[img] Text (BAB V available document only in library of Soegijapranata Catholic University)
06.02.0008 Albert Agung Ivan H BAB V.pdf
Restricted to Repository staff only

Download (544kB)
[img] Text (BAB VI)
06.02.0008 Albert Agung Ivan H BAB VI.pdf
Restricted to Registered users only

Download (85kB)
[img]
Preview
Text (DAFTAR PUSTAKA)
06.02.0008 Albert Agung Ivan H DAFTAR PUSTAKA.pdf

Download (80kB) | Preview

Abstract

This game is a simple game, which is played by two characters. Where the mouse is called the user and doraemon is called the computer (AI). In this game the mouse (user) can move one step in left, up, right, and down to find the door to finish, and doraemon (computer) will eat mouse and prevented from reaching the door finish. This game uses backtracking algorithm. This algorithm is applied to locate the mouse. Step movement computer stored in tree. This game will end when the mouse reaches the finish or the mouse in a pinch not find a way. In this game backtracking algorithm is not perfect in the search process mouse (player) because the mouse is always moving. Backtraking algorithm will be optimized when performing a search of placing fixed and not moving.

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

Actions (login required)

View Item View Item