# Computational approach deciding whether a set of Wang Tile could tile the space up to some size

As an applied person, I'm facing one practical problem deciding whether a set of Wang tile could tile the plane periodically or aperiodically. Although both problems seem undecidable, but I'm on a more practical aspect. Say, if the program accidentally ("or systematically") find some "periodic structure", then it stops and tells me there exists periodic pattern. If during running, it enumerates all the use of tile and finds that it simply cannot tile the plane, then it tell me this set of tiles cannot tile the plane. Even if the program didn't stop, then after running some steps, it returns me a few most ordered patterns that that could "possibly tile the plane".

For practical purpose, I simply assume if the tessellation are up to some size (maybe 1000*1000) then I say "it could tile the plane practically".

So my most interested question is: is there any established programs or algorithms that "try" to help me analyze a set of tile even if it might not halt ("but I could define some imposed halting condition").

For context why I am interested in this problem, here's the links:

coloring in lattice

Reference for Wang Tile

Periodic Tiling of Wang tile

Cross-posted to:

https://cs.stackexchange.com/questions/21502/computational-approach-deciding-whether-a-set-of-wang-tile-could-tile-the-space

• Feb 10, 2014 at 21:54
• Dear @user40780, please do not post questions simultaneously to multiple sites. It leads to unnecessary duplication of effort, and is commonly frowned upon by the MathOverflow community and others. Please post to one site and wait at least a few days for an answer. Feb 10, 2014 at 22:56
• This is actually a more practical problem. I wish to have it solved.... Feb 14, 2014 at 18:38
• You may be interested to explore this book: Wang Tiles in Computer Graphics, to see if it can give insights to your problem. Feb 15, 2014 at 1:09