Rush hour puzzle solver dengan metode heuristik = Rush hour puzzle solver with heuristic method

Prima, Sonny Daya (2012) Rush hour puzzle solver dengan metode heuristik = Rush hour puzzle solver with heuristic method. Bachelor thesis, Universitas Pelita Harapan.

[thumbnail of Title] Text (Title)
Title.pdf
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (1MB)
[thumbnail of Abstract] Text (Abstract)
Abstract.pdf
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (336kB)
[thumbnail of Chapter1] Text (Chapter1)
Chapter1.pdf
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (329kB)
[thumbnail of Chapter2] Text (Chapter2)
Chapter2.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (407kB)
[thumbnail of Chapter3] Text (Chapter3)
Chapter3.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (893kB)
[thumbnail of Chapter4] Text (Chapter4)
Chapter4.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (807kB)
[thumbnail of Chapter5] Text (Chapter5)
Chapter5.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (276kB)
[thumbnail of Bibliography] Text (Bibliography)
Bibliography.pdf
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (343kB)
[thumbnail of Appendices] Text (Appendices)
Appendices.pdf
Restricted to Repository staff only
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (9MB)
[thumbnail of Publication Agreement] Text (Publication Agreement)
Publication Agreement.pdf
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (367kB)

Abstract

Rush hour puzzle is a problem space puzzle that become famous in 1996. Playing this puzzle manually sometimes comes to a dead end, so a solver is needed. However the solver is available only for smartphones, so this developed application can run on pc. This puzzle can be solved by an algorithm that is called best first search, and some random method. Best first search is an algorithm that is based on heuristic method that can be used to find the optimum cost by following some rules that have been set. However using just best first search cannot find the solution for this puzzle, so a random method to find some alternative moves is needed. This solver can be used to find some other moves to solve rush hour puzzle. This solver can solve 68 of 75 types of game that are provided, that means the success rate is 89,3%. Because the algorithm that is used by this puzzle are best first search and random, the result of the solver are not always minimum moves as presented in the result.
Item Type: Thesis (Bachelor)
Creators:
Creators
NIM
Email
ORCID
Prima, Sonny Daya
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
Contributors:
Contribution
Contributors
NIDN/NIDK
Email
Thesis advisor
Lazarusli, Irene Astuti
UNSPECIFIED
UNSPECIFIED
Thesis advisor
Aribowo, Arnold
UNSPECIFIED
UNSPECIFIED
Additional Information: SK 82-08 PRI r
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: University Subject > Current > Faculty/School - UPH Karawaci > School of Information Science and Technology > Informatics
Current > Faculty/School - UPH Karawaci > School of Information Science and Technology > Informatics
Depositing User: Mr Samuel Noya
Date Deposited: 04 Oct 2018 06:53
Last Modified: 04 Oct 2021 08:36
URI: http://repository.uph.edu/id/eprint/825

Actions (login required)

View Item
View Item