Browse By Repository: Browse by Year Browse by Subject Browse by Division Browse by Author Browse by Type Statistic

# Solving knight's tour problem using paddy field algorithm

Art Harris , Lambiase (2014) Solving knight's tour problem using paddy field algorithm. Project Report. UTeM. (Submitted)

 Text SOLVING KNIGHT’S TOUR PROBLEM USING PADDY FIELD ALGORITHM 24pages.pdf Download (663Kb)

## Abstract

The main purpose of this project is to solve the knight’s tour problems (KTP) by using paddy field algorithm (PFA). KTP is a sub-chess puzzle where the main purpose of the puzzle is to find combination move made by a knight so that it visits every square of the chessboard exactly once. The knight’s tour problem is focusing on the mathematical problem of finding a knight’s tour moving sequence. In approach with this related application is view from the assembly stability and the number of assembly orientation. KTP is not viewed just from the puzzle it represents, but the concept that can be used in other related fields of engineering application. The objective of this project are to solve the mathematical problem of KTP and design a model using PFA to solve KTP. MATLAB software is used to design the coding to solve the KTP. In this project the size of the chessboard use will be 8x8 as this is to define the moving pattern sequences of the knight. Furthermore, the performance of optimization technique used which is PFA will be evaluate with the performance of Firefly Algorithm (FA). The end result was evaluated in terms of the success rate of finding optimal solution for only 1 locations of the movement made by the knight. There are many method of optimization technique to solve the KTP. The optimization consists of maximizing or minimizing the value to find the optimal best value. There is other several types and method of optimization algorithm can be used to solve the KTP such as the Binary Magnetic Optimization algorithm, Firefly algorithm, Particle Swarm Optimization and many more. The KTP has been solved by many optimization method and the PFA method is new to solve this type of problem. The previous research reveal that the KTP solved with different method produce different output specification such as the accuracy and other.

Item Type: Monograph (Project Report) Computer algorithms Q Science > QA MathematicsQ Science > QA Mathematics > QA76 Computer software Library > Projek Sarjana Muda > FKE Norziyana Hanipah 17 Feb 2016 04:01 17 Feb 2016 04:01 http://eprints.utem.edu.my/id/eprint/15725

### Actions (login required)

 View Item

### Downloads

Downloads per month over past year