Penerapan metode rule-based dan teknik pencarian depth first search dalam penyelesaian puzzle slitherlink = Solving slitherlink puzzle using rule-based method and depth first search technique

Susanti, Susanti (2012) Penerapan metode rule-based dan teknik pencarian depth first search dalam penyelesaian puzzle slitherlink = Solving slitherlink puzzle using rule-based method and depth first search technique. Bachelor thesis, Universitas Pelita Harapan.

Full text not available from this repository.

Abstract

Slitherlink merupakan puzzle logika yang menarik karena banyak alasan, salah satunya mempunyai bentuk dan ukuran yang beragam. Puzzle ini terdiri dari sel dan angka. Tugas akhir ini membahas penyelesaian slitherlink berbentuk segitiga dengan ukuran maksimum 20x20 karena sudah banyak penelitian yang membahas slitherlink dengan bentuk persegi. Dalam tugas akhir ini, dilakukan penelitian mengenai cara penyelesaian puzzle slitherlink, serta pembuatan piranti lunak untuk menyelesaikannya. Piranti lunak dibuat dengan menggunakan metode rule-based dan teknik pencarian depth first search. Jika metode rule-based tidak mampu menyelesaikan persoalan, maka digunakan teknik pencarian depth first search. Teknik pencarian depth first search dilakukan dengan mengasumsikan nilai sel yang kosong. Dasar pemikirannya adalah jika nilai dari semua sel diketahui, maka solusi akan tercapai dengan menggunakan metode rule-based. Setelah piranti lunak selesai dibuat, maka dilakukan pengujian terhadap soal puzzle slitherlink dengan empat macam bentuk, yaitu 7x7, 10x10, 15x15, dan 20x20 dengan empat tingkat kesulitan berbeda, yaitu easy, normal, tricky, dan hard. Hasil yang diperoleh adalah waktu untuk menyelesaikan puzzle dipengaruhi oleh ukuran dan tingkat kesulitan puzzle. / Slitherlink is an interesting logic puzzle because of for many reasons, such as, it has various shapes and sizes. This puzzle consists of cells and numbers inside each cell. This final project will particularly discusses the triangular slitherlink with maximum size 20x20. The original shape, square is not discussed because many papers have already done it. In this thesis research is conducted to solve the puzzle and to develop the software. The software is built based on the rule-based method and the depth first search technique. If the rule-based method cannot solve the puzzle, then the depth first search algorithm will be applied. Depth first search technique is done by assuming value in the empty cell based on the idea that if all the cells have value, then the solution will be achieved by using the rule-based method. Testing is an importent thing to do after the software is finished. Testing is conducted by examining four kinds of puzzles of different sizes, 7x7, 10x10, 15x15, and 20x20. Each size consists of four different difficulty levels, which are easy, normal, tricky, and hard. The conclusion of the testing is size and difficulty level influence the time to solve puzzle.

Item Type: Thesis (Bachelor)
Creators:
CreatorsNIMEmail
Susanti, SusantiNIM08220080015UNSPECIFIED
Contributors:
ContributionContributorsNIDN/NIDKEmail
Thesis advisorLukas, SamuelNIDN03310760001samuel.lukas@uph.edu
Additional Information: SK 701-08 SUS p
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: University Subject > Current > Faculty/School - UPH Karawaci > Faculty of Science and Technology > Mathematics
Current > Faculty/School - UPH Karawaci > Faculty of Science and Technology > Mathematics
Depositing User: Mrs Veronica Fitri Astuti
Date Deposited: 12 May 2021 14:17
Last Modified: 02 Nov 2023 11:52
URI: http://repository.uph.edu/id/eprint/18279

Actions (login required)

View Item View Item