BSQ

{EPITECH} The goal of this project is to find the biggest square in a map made up of '.' and 'o'.

HOW TO USE

REQUIREMENTS

• GCC
• Make
• NCURSES (for the bonus)

USAGES

Compilation

make

Execution

./bsq maps/map1

BONUS

Go to the bonus directory and do the previous actions.

MAP FORMAT

• You can find exemples in maps directory.
• The first line is the number of lines in the map.
• The map is only made of . (empty) and o (obstacles) symbols.
• The map is always a rectangle.
• All lines have the same size.

SCREENSHOTS

DEVELOPMENT

• C
• NCURSES

AUTHOR

• Ilan Benarroche - (Github / LinkedIn)