2 ms·
But you can easily phrase it as an NP-hard problem: Are there at least X unique solutions to a board of particular size?
by bjourne 5y ago
But you can easily phrase it as an NP-hard problem: Are there at least X unique solutions to a board of particular size?