Starting position for a tree search

You can find any tiling pattern in the system by answering a number of simple questions. Eventually, the number of patterns satisfying the properties you have specified will be small enough to display them all - at this point you can select the one you want. If you make a mistake with your selection, you can use the link to the previous selection at the bottom of the page.
You should read the documentation here.
Since this is the starting position, there are 2889 patterns to choose from.
The first question is to determine if the pattern is a repeat-pattern or if it does not repeat. For repeat pattern, one can choose two positions such that translating the pattern from one position to the other makes no change to it. Two examples of a repeat pattern are:
For this case, you can proceed to the next question. This case includes 2616 patterns being 90% of the total above.
The other possibility is that the pattern does not repeat. These usually means that there is some special point which occurs only once. This special point is usually at the centre of the pattern as shown. Alternatively, the pattern may appear in a strip which will repeat in a vertical direction, or the display indicates a pattern which does not continue in either direction. Two examples of a non-repeating pattern are:
For this case, you can proceed to the next question. This case includes 273 patterns being 9% of the total above.
You need to select one of the two options above.

Further details



Tiling Search was created by Brian Wichmann, and is maintained by MIT Libraries, through support from the Aga Khan Documentation Center.

Also supported by Performant Software Solutions LLC.