WEB-REPORT | |||||||||||

Authentication: We declare that the web-report is our own work and does not contain plagiarised material | |||||||||||

Group | 8-14 | ||||||||||

Project Title | THE KNIGHT"S TRAIL | ||||||||||

Synopsis | We all know that the knight moves in a unique way. But do you know that even with this unique path, it still can visit every grid on the chessboard without revisiting the grids. This is known as the famous mathematical problem "The Knight's Tour". We embark on this project, "The Knight's Trail" because we are inspired by a math project done by our Hwa Chong seniors in 2013, called "The Confused Knight". Their project investigates about how the knight can visit every grid of the board given a designated starting point and ending point. This time, our project aims to investigate how the ant-optimization algorithm can overcome the limitation of the Warnsdorf's Rule and proof that Knight's tour exists in a n × n × n board. In a n × n × n board, the knight moves like how it moves in the original chessboard, in any direction. Hence, a knight would have at most 24 possible moves on a square. (163 words) |
||||||||||

Link to start page | Click HERE to access web-report | ||||||||||

Special
instructions for evaluator to take note |
Nil | ||||||||||

Team Members (Names & Classes) |
Group Leader: | ||||||||||

YEOH YONG JIE 3S1 | |||||||||||

Group Member/s: | |||||||||||

TAN CHERN LIN JUSTIN 3S2 | |||||||||||

TIN EN HAO 3S3 | |||||||||||