PENERAPAN ALGORITMA BREADTH FIRST SEARCH DAN DEPTH FIRST SEARCH PADA PERMAINAN SLIDE PUZZLE
| Main Authors: | Maulana I, Dimas, Sidik Sasongko, Priyo |
|---|---|
| Format: | Thesis NonPeerReviewed application/pdf |
| Terbitan: |
, 2009
|
| Subjects: | |
| Online Access: |
http://eprints.undip.ac.id/5202/1/JUDUL.pdf http://eprints.undip.ac.id/5202/2/BAB_I_dan_II.pdf http://eprints.undip.ac.id/5202/ |
Daftar Isi:
- Slide puzzle is a game to compile pieces of a picture appropriate to its position. A piece can only be moved by screp it out to the empty space, and it is going to be a difficulty apart to finish the game. Slide puzzle needs an algorithm, way to search for which is used to get the game solution. In this paper is explained about applying of Breadth First Search and Depth First Search algorithm in the slide puzzle game by using Microsoft Visual Basic 6.0. After that, it would be tested to finishing game manually (using people as player) and finishing game by using Breadth First Search and Depth First search algorithm (in this case computer). From the result of test, can be seen that searching by algorithm can be used to optimal of time and path solution in finishing slide puzzle which usually can’t be done if finishing game manually.