Implementation Backtracking Algorithm, and Tree in Mouse Trap Maze Game
ctrlnum |
7524 |
---|---|
fullrecord |
<?xml version="1.0"?>
<dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><relation>http://repository.unika.ac.id/7524/</relation><title>Implementation Backtracking Algorithm,
and Tree in Mouse Trap Maze Game</title><creator>Ivan, Albert Agung</creator><subject>Data processing & computer science</subject><description>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.</description><date>2010</date><type>Thesis:Thesis</type><type>PeerReview:NonPeerReviewed</type><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7524/1/06.02.0008%20Albert%20Agung%20Ivan%20H%20COVER.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7524/2/06.02.0008%20Albert%20Agung%20Ivan%20H%20BAB%20I.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7524/3/06.02.0008%20Albert%20Agung%20Ivan%20H%20BAB%20II.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7524/4/06.02.0008%20Albert%20Agung%20Ivan%20H%20BAB%20III.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7524/5/06.02.0008%20Albert%20Agung%20Ivan%20H%20BAB%20IV.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7524/6/06.02.0008%20Albert%20Agung%20Ivan%20H%20BAB%20V.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7524/7/06.02.0008%20Albert%20Agung%20Ivan%20H%20BAB%20VI.pdf</identifier><type>Book:Book</type><language>eng</language><identifier>http://repository.unika.ac.id/7524/8/06.02.0008%20Albert%20Agung%20Ivan%20H%20DAFTAR%20PUSTAKA.pdf</identifier><identifier> Ivan, Albert Agung (2010) Implementation Backtracking Algorithm, and Tree in Mouse Trap Maze Game. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata. </identifier><recordID>7524</recordID></dc>
|
language |
eng |
format |
Thesis:Thesis Thesis PeerReview:NonPeerReviewed PeerReview Book:Book Book |
author |
Ivan, Albert Agung |
title |
Implementation Backtracking Algorithm,
and Tree in Mouse Trap Maze Game |
publishDate |
2010 |
topic |
Data processing & computer science |
url |
http://repository.unika.ac.id/7524/1/06.02.0008%20Albert%20Agung%20Ivan%20H%20COVER.pdf http://repository.unika.ac.id/7524/2/06.02.0008%20Albert%20Agung%20Ivan%20H%20BAB%20I.pdf http://repository.unika.ac.id/7524/3/06.02.0008%20Albert%20Agung%20Ivan%20H%20BAB%20II.pdf http://repository.unika.ac.id/7524/4/06.02.0008%20Albert%20Agung%20Ivan%20H%20BAB%20III.pdf http://repository.unika.ac.id/7524/5/06.02.0008%20Albert%20Agung%20Ivan%20H%20BAB%20IV.pdf http://repository.unika.ac.id/7524/6/06.02.0008%20Albert%20Agung%20Ivan%20H%20BAB%20V.pdf http://repository.unika.ac.id/7524/7/06.02.0008%20Albert%20Agung%20Ivan%20H%20BAB%20VI.pdf http://repository.unika.ac.id/7524/8/06.02.0008%20Albert%20Agung%20Ivan%20H%20DAFTAR%20PUSTAKA.pdf http://repository.unika.ac.id/7524/ |
contents |
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. |
id |
IOS2679.7524 |
institution |
Universitas Katolik Soegijapranata |
institution_id |
334 |
institution_type |
library:university library |
library |
Perpustakaan Universitas Katolik Soegijapranata |
library_id |
522 |
collection |
Unika Repository |
repository_id |
2679 |
subject_area |
Akuntansi Arsitektur Ekonomi |
city |
SEMARANG |
province |
JAWA TENGAH |
repoId |
IOS2679 |
first_indexed |
2017-02-25T15:02:35Z |
last_indexed |
2017-02-25T15:02:35Z |
recordtype |
dc |
_version_ |
1765771673353584640 |
score |
17.538404 |