We are about to switch to a new forum software. Until then we have removed the registration on this forum.
By Paolo Gibellini Original uploader was P.gibellini at it.wikipedia - Transferred from it.wikipedia; transfer was stated to be made by User:p.gibellini. (Original text : myself), Public Domain, https://commons.wikimedia.org/w/index.php?curid=4158376
Given the above image of Truchet Tiles. I would like to draw out every single permutation of Truchet Tiles via processing. However with an important caveat. The traditional Truchet Tile has half of it's square area filled by a black triangle. I would like to treat a single tile as composed of 4 "Truchet Tiles" (or a 2x2 Truchet Tile).
What the image above is missing (in my opinion) however and I would like to include is the case when a tile may be completely white. So all together each of the 4 squares that make up one 2x2 Truchet Tile has 5 distinct possibilities.
That should result in (5 * 5 * 5 * 5=) 625 total permutations!
So in sum, I would like to be able to first procedurally draw out every single one of these permutations, and then eventually be able to store them somehow and randomly generate patterns that are composed of different combinations of these unique looking tiles.
I am curious as to whether these patterns will look different or significantly depart from traditional truchet tiles. When truchet tiles are normally in a pattern, they may end up neighboring each other to create 2x2 Truchet tiles, but I wonder if making the tiles grouped together like this to begin with will result in more interesting 4x4 neighbors.
In the above image, just to clarify. The red outlines a traditional truchet tile. In blue is outlined a 2x2 truchet tile, which I am interested in permutating.