#KNIGHT'S_TOUR

ABOUT MY PROJECT

I build a simple web page about Knight's Tour by HTML, CSS and Javascript.

Knight's Tour is a classical problem in graph theory. The object of this problem is to find a sequence of moves that allow the knight to visit every square on the board.

My solution is using Hamilton Algorithm to find the nearest way to trace

• If it is found: output answer.
• If it is not found: rollback, recur and trace another way.

I tried this and explored numerous interesting aspects.

For further improvements, I will update soon.

Thanks for viewing <3