Wang tiles are interesting in that they can simulate Turing machines. My question is whether anyone has studied their game theoretic properties?


In particular, we could imagine a game in which you have a plane with some Wang tiles on it, and players take turns placing tiles adjacent to tiles already on the board. The last player to place a tile wins. This is only one example of how to gamify Wang tiles, of course.


Is there any research into the games based on Wang tiles?



Game theoretic aspects of Wang tiles?
Perhaps the key search phrase is "domino-tiling games." This 1986 paper
seems to be a source, subsequently cited ~100 times.



> 
> Chlebus, Bogdan S. "Domino-tiling games." *Journal of Computer and System Sciences* 32.3 (1986): 374-392. [Journal link](http://www.sciencedirect.com/science/article/pii/002200008690036X).
> 
> 
> **Abstract**. Games in which players build domino tilings are considered. The computational complexity of problems of existence of winning strategies is investigated. These problems are shown to be complete in the respective complexity classes, e.g., SQUARE TILING GAME is complete in PSPACE, HIGH TILING GAME is complete in 2EXPTIME and has a doubly exponential time lower bound. As an application, new simple hardness proofs for certain propositional logics are obtained.
> 
> 
> 


Among the later papers:
Grädel, Erich. "Domino games and complexity." *SIAM Journal on Computing* 19.5 (1990): 787-804. [Journal link](http://epubs.siam.org/doi/abs/10.1137/0219055).


