1 citations · 1 across the 2 of their papers we have counts for
1 paper · 1 filter
Michiel de Bondt
We give a simple proof of that determining solvability of Shisen-Sho boards is NP-complete. Furthermore, we show that under realistic assumptions, one can compute in logarithmic ti…