Wamiliana, Wamiliana and Kurniasari, Dian (2013) Implementasi Algoritma Backtrack untuk Pencarian Solusi Knight’s Tour Problem pada Papan Catur m x n. Jurnal Komputasi, 1 (1). pp. 36-46. ISSN 2541-0350

Preview

Text Implementasi Algoritma Backtrack untuk Pencarian Solusi.pdf Download (1MB) | Preview

Abstract

This research discusses about finding all solutions of The Knight's Tour Problem. The steps done by a knight on a chess board forms a path. If the track is able to pass through all points (boxes) and can return to the original point (box) is called as Hamilton Cycle, that produces Closed Knight's Tour; if the path can pass through all the points but can not return to the original point of the track is called as Open Knight's Tour. There are various ways to solve the Knight's Tour Problem, one of which is to use the Backtrack algorithm. In this paper we will discuss of finding all solutions of Knight’s Tour Problem vary from 3x3 up to 8x8 chessboards.

Item Type:	Article
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:	Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Ilmu Komputer
Depositing User:	DIAN KURNIASARI
Date Deposited:	04 Jun 2018 06:33
Last Modified:	04 Jun 2018 06:33
URI:	http://repository.lppm.unila.ac.id/id/eprint/7004

Actions (login required)

View Item