Knight's Tour Problem

Knight's Tour Problem is a problem where we have to find a path for a knight to visit all the cells of a chessboard without visiting any cell twice.

Visit the following resources to learn more:

Open Source

The project is OpenSource, 6th most starred project on GitHub and is visited by hundreds of thousands of developers every month.

Community created roadmaps, articles, resources and journeys to help you choose your path and grow in your career.

The leading DevOps resource for Kubernetes, cloud-native computing, and the latest in at-scale development, deployment, and management.