Wednesday, January 07, 2009

Troyis Game

I came across this game called Troyis. Being a theoretician, whenever I come across a new game, the first question that comes to my mind is "What is its complexity ?". Here is the decision version of Troyis :
  • TROYIS : Given an instance of Troyis, can you paint all the white cells in <= k clicks ?
Here is a puzzle : Prove (or disprove) that TROYIS is NP-complete.

No comments: