# kiwifarm

The algorithm has been developed to address the following problem:

```
A knight is in a known cell on an empty chessboard and needs to reach another known cell.

Write a Python program that can take as input the two positions on the chessboard and returns as output:

* the set of all minimum-length sequences to move the piece from the initial cell to the final cell;
* a graphviz/dot file of the previous "all shortest path" graph.
```

## Getting started
You can build and run the algorithm using the run.sh file

### Build
To build the algorith and then run it use:
```
./run.sh build 4 5 test
```
The first element is the build or run commend that will build the container or use an already built one. then it is X and Y cordination of the destination and then the name of the output file

If you do not want to build it you can use:
```
./run.sh run 4 5 test
```