Author: Thomas Violent
This is a solver for the BSQ problem:
You have a map (or 2D array) with obstacles (black dot). you want to find the biggest square possible with no obstacle on this map.
Tableau de 250/250, taille du carré rouge: 21
-
Notifications
You must be signed in to change notification settings - Fork 1
Samoth69/ProgDyn
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published