==Computational complexity== Shakashaka is NP-complete to decide whether a given Shakashaka puzzle has a solution. Furthermore, counting the number of solutions to a given Shakashaka puzzle is #P-complete. ... Found on http://en.wikipedia.org/wiki/Shakashaka
1) Logic puzzle 
==Computational complexity== Shakashaka is NP-complete to decide whether a given Shakashaka puzzle has a solution. Furthermore, counting the number of solutions to a given Shakashaka puzzle is #P-complete. ...