BSQ : Find the Biggest SQuare

The project

• Find the largest possible square on a board while avoiding obstacles
• The board is represented by a file passed as the program’s argument
  • each obstacles are represented by "o", and empty space by "."
  • all of the lines are of the same length
  • file's first line contains the number of lines on the board (and only that)
• The program must print the board with some "." replaced by "x" to represent the solution found.

Mark

Details	Mark (/20)
map tests: 100% - special cases: 100% - error handling: 100%	20.00

Build

$ make all

Usage

$ ./bsq map.txt

Examples