KnightsTour

KO | EN

gitlite — search

#typescript #go #android #machine-learning #rust #java #nodejs #cli #awesome-list #pytorch #security #ios #mcp #openai

(★ 9)

Knights Tour solved using Python.

KnightsTour 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Knights Tour Problem

Knights Tour solved using Python.

(And graphically with PyGame.)

### Requirements:
- [Python 2.7 or greater](https://www.python.org/)
- [PyGame 1.9.2](http://pygame.org/hifi.html)
- [Numpy](http://www.numpy.org/)

## About

This program was made as part of the very first homework of a course taken back in 2015.
The way the problem was solved is using backtracking and recursion, applying the Wansdorff's rule.

## Input

The program won't need any arg variables, but it'll ask you for the dimensions of the board and the initial positions in x and y, in order to begin to compute a solution. The positions are integer values in `[0,N-1]x[0,N-1]`.

### Constraints:

Of course, some constraints apply to have a solution. If you want a solution, the `N` from the input must be greater than 5. Also, for a graphical tour, `N` must be less than 32.

## Running the script

To run the script, just open a terminal in the directory where the script and run it by doing:
```bash
python Knights.py
```

(You just have to be sure to have the [`knight.png`](https://github.com/RodolfoFerro/KnightsTour/blob/master/knight.png) and [`chess.png`](https://github.com/RodolfoFerro/KnightsTour/blob/master/chess.png) files.)

## Output

The program will return a `numpy` matrix with the tour, and a list with the positions of the knight, which is used to create the graphical tour. An example of this can be seen here:

![Knights Tour](https://github.com/RodolfoFerro/KnightsTour/blob/master/Knights.gif "Knights Tour")

KnightsTour

KnightsTour 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

KnightsTour

KnightsTour 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README