Jurnal Komputasi
Vol 1, No 1 (2013)

IMPLEMENTASI ALGORITMA BACKTRACK UNTUK PENCARIAN SOLUSI KNIGHT’S TOUR PROBLEM PADA PAPAN CATUR m x n

Wamiliana, Wamiliana (Unknown)
Kurniasari, Dian (Unknown)
Yudhistira, Dolly (Unknown)

Article Info

Publish Date
20 Sep 2016

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.Keywords: knight’s tour problem, backtrack algorithm, open and closed knight’s tour

Copyrights © 2013




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Jurnal Komputasi
Website

Abbrev

komputasi

Publisher

Universitas Lampung

Subject

Computer Science & IT

Description

Lingkup dan fokus jurnal berkaitan dengan tema-tema computer science, information technology, information system, software engineering, data mining, artificial intelligence, networking, multimedia, database, dan operating ...