Skip to content

About

Knight's tour problem solved using recursion and backtracking

Topics

Resources

Stars

0 stars

Watchers

1 watching

Forks

Latest commit

 

History

2 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 

Repository files navigation

knightstour

A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square exactly once.

Next step is to implement the Warnsdorff's rule

About

Knight's tour problem solved using recursion and backtracking

Topics

Resources

Stars

0 stars

Watchers

1 watching

Forks

Contributors

Languages