https://github.com/beebombshell/knight-tour-problem-simulator

The project aims to solve the Knight Tour Problem using the idea of tracing paths and circuit through a graph with a given set of vertices and edges and define an algorithm for the same.
https://github.com/beebombshell/knight-tour-problem-simulator

Last synced: 8 months ago
JSON representation

The project aims to solve the Knight Tour Problem using the idea of tracing paths and circuit through a graph with a given set of vertices and edges and define an algorithm for the same.

• Host: GitHub
• URL: https://github.com/beebombshell/knight-tour-problem-simulator
• Owner: BeeBombshell
• Created: 2021-06-23T10:49:19.000Z (about 5 years ago)
• Default Branch: main
• Last Pushed: 2021-06-23T11:09:47.000Z (about 5 years ago)
• Last Synced: 2025-01-19T21:43:43.754Z (over 1 year ago)
• Language: Python
• Size: 662 KB
• Stars: 3
• Watchers: 2
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# Knight-Tour-Problem-Simulator :horse:

[![forthebadge](https://forthebadge.com/images/badges/built-with-love.svg)](https://forthebadge.com) [![forthebadge](https://forthebadge.com/images/badges/made-with-python.svg)](https://forthebadge.com)

The Knight Tour Problem is a classical problem in the game of Chess. The idea is to make a knight piece trace each square in a n x n Chess board (conventionally n=8). The knight is supposed to trace with its defined move i.e., two squares away horizontally and one square vertically, somewhat trailing an L- shape.

![Knight's Movement](https://www.flyintobooks.com/wp-content/uploads/2021/04/Knight-Chess-Piece-Moves-Flyintobooks.com_.png)

The project aims to solve the Knight Tour Problem using the idea of tracing paths and circuit through a graph with a given set of vertices and edges and define an algorithm for the same.