 |
 |
The goal of lem-in is to navigate a group of ants through a maze from the start room to the end room in the least number of turns, while avoiding collisions and following specific rules.
Before running Lem-In, make sure you have Go installed on your system. You can download and install it from the official Go website.
-
Clone the repository:
git clone https://learn.zone01dakar.sn/git/nifaye/lem-in
-
Navigate to the project directory:
cd lem-in -
Build the executable:
go build
-
Run Lem-In Go with the following command:
./lem-in <input.txt>
-
Replace input.txt with your own input file containing the Lem-In data.
Lem-In Go uses a combination of graph traversal algorithms and heuristics to find the optimal path for the ants. The main steps of the algorithm include:
- Parsing the input data to create a graph representation of the maze.
- Applying graph traversal algorithms (e.g., Dijkstra's algorithm) to find the shortest paths from the start room to the end room. See more
- Distributing ants along the paths while avoiding collisions.
Contributions to Lem-In are welcome! If you find any issues or have suggestions for improvements, feel free to open an issue or create a pull request.