diff options
| author | William Carroll <wpcarro@gmail.com> | 2020-11-13T16·56+0000 |
|---|---|---|
| committer | William Carroll <wpcarro@gmail.com> | 2020-11-13T16·56+0000 |
| commit | 7672049e1cc25b2848245c565329240c95d2e96d (patch) | |
| tree | 0468b98a038aa325dcd3b5459e679c6310e71496 /scratch/facebook/stacking-boxes.py | |
| parent | 14f6169fcf5c34455c21ca80850eeb5652a85e4a (diff) | |
Solve N queens
After a five year hiatus, I decided to attempt to solve the famous N queens problem again. This time, instead of modeling the chess board using a `[[Bool]]`, I'm using `[Integer]` where the `Integer` indicates which column has a queen. This is a bit lighter in RAM.
Diffstat (limited to 'scratch/facebook/stacking-boxes.py')
0 files changed, 0 insertions, 0 deletions