PAKPAHAN, YAN SWARLAN PARULIAN (2013) APLIKASI PENYELESAIAN PERMAINAN PUZZLE HASHIWOKARERO MENGGUNAKAN TEKNIK HASHI DAN DEPTH FIRST SEARCH. S1 thesis, Universitas Mercu Buana.
|
Text (HAL COVER)
Isi_cover_913258996776.pdf Download (774kB) | Preview |
|
|
Text (ABSTRAK)
Isi_abstract_495793626565.pdf Download (94kB) | Preview |
|
|
Text (BAB I)
Isi1899546914574.pdf Restricted to Registered users only Download (75kB) |
||
|
Text (BAB II)
Isi2466073878882.pdf Restricted to Registered users only Download (139kB) |
||
|
Text (BAB III)
Isi3440522048211.pdf Restricted to Registered users only Download (393kB) |
||
|
Text (BAB IV)
Isi4982751407516.pdf Restricted to Registered users only Download (357kB) |
||
|
Text (BAB V)
Isi5320316232057.pdf Restricted to Registered users only Download (17kB) |
||
|
Text (DAFTAR PUSTAKA)
Isi_pustaka269475994171.pdf Restricted to Registered users only Download (482kB) |
Abstract
Hashi is a logic game that sharpen the brain and is very popular in Japan. Hashi game played on a rectangular grid. In the box, there are some circle (cells) located both horizontally and vertically. This cell also known as node. This application is discussed about how to find a resolution to the Hashi puzzle game using four Hashi solving techniques, they are: Just Enough Neighbor, One Unsolved Neighbor and Depth First Search (DFS). Hashi Solving techniques are used to locate and build bridges that can definitely be built between the nodes, while the DFS search and build the rest of the bridges that were not found by Hashi Solving techniques. At the end, Hashi Solving techniques and DFS can solve every Hashi puzzle scenario. Key words: Hashiwokakero, Hashi Solving techniques. Depth First Search.
Actions (login required)
![]() |
View Item |
