Skip to content

This repository solves the maximum free path in a labyrinth problem, as specified in the JdeRobot project application for Google Summer of Code 2017.

License

Notifications You must be signed in to change notification settings

Santi-7/GSoC-Labyrinth

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

GSoC-Labyrinth

This repository solves the maximum free path in a labyrinth problem, as specified in the JdeRobot project application for Google Summer of Code 2017.

Labyrinth problem

Lets imagine you have a labyrinth described as walls (#) and holes (.) where you cannot pass through the walls and you can move to adjacent holes. Diagonal adjacencies will not be taken into account, only vertical and horizontal.

Your applications should find the largest pathway moving only between holes, reading the labyrinth schema from a txt file, using only standard libraries of c++11. All the lines in the input file will have the same number of elements. Your application should save the schema of the largest detected pathway, overwriting the holes (.) with the order in which the hole has been visited.

Example:

input:

input

output:

6

output

Compilation

Run from the project directory:

mkdir build
cd build
cmake ..
make

Usage

Labyrinth <input_file>

The program will output the result in a file with name 'output.txt'.

Authors

This project was made by Santiago Gil Begué.

Apache 2.0 license. If you use this code or parts of it, please name me.

About

This repository solves the maximum free path in a labyrinth problem, as specified in the JdeRobot project application for Google Summer of Code 2017.

Topics

Resources

License

Stars

Watchers

Forks

Packages

No packages published