Warnsdorffs Algorithm

1
Warnsdorffs Algorithm

• By Ben Homan

2
Table of Contents

• What is it?
• Before Shot
• Why I thought I should update it
• The After Shot
• What I did to update the page
• Questions and/or Comments

3
What is it?

• Warnsdorffs Algorithm is a heuristic method to
  solve the Knights Tour problem.
• Knights Tour - Ancient Puzzle The goal is to
  move the knight everywhere on a chessboard but
  until to each spot once

4
The Before Shot
5
Why I thought I should update it

• Severe lack of information
• Interesting topic

6
The After Shot
7
What I Did to Update the Page

• Added more in-depth description
• Added images to help visualize the algorithm
• Included pseudo code of how this would be adapted
  for computers
• Included sample code in C of a program that
  will find a Knights Tour

8
Questions or Comments?