Wang Tiles: Difference between revisions
Jump to navigation
Jump to search
→Busy Beaver function: Fixed first champion |
m →Busy Beaver function: proper subscript |
||
| (5 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
{{Stub}} | |||
'''Wang Tiles''' (or Wang dominoes) are a class of formal mathematical systems first proposed by Hao Wang in 1961. They consist of equal-sized square tiles with colored edges that are arranged side-by-side on a regular grid. | '''Wang Tiles''' (or Wang dominoes) are a class of formal mathematical systems first proposed by Hao Wang in 1961. They consist of equal-sized square tiles with colored edges that are arranged side-by-side on a regular grid. | ||
| Line 10: | Line 11: | ||
Define the ''score'' of a set of Wang tiles as the largest d such that it can tile a dxd square, or 0 if there is no largest d. | Define the ''score'' of a set of Wang tiles as the largest d such that it can tile a dxd square, or 0 if there is no largest d. | ||
Then | Then BB<sub>WT</sub>(n) = the maximum score over all n-tile sets. | ||
The current format to describe a set of tiles is a list of tuples that have 4 nonegative numbers, each representing a side color. Example: <code>[TOP,RIGHT,BOTTOM,LEFT]</code> | The current format to describe a set of tiles is a list of tuples that have 4 nonegative numbers, each representing a side color. Example: <code>[TOP,RIGHT,BOTTOM,LEFT]</code> | ||
| Line 18: | Line 19: | ||
!Value | !Value | ||
!Champion | !Champion | ||
!Image | |||
|- | |- | ||
|1 | |1 | ||
|1 | |1 | ||
|<code>[1,0,0,0]</code> | |<code>[1,0,0,0]</code> | ||
|[[File:BusyBeaverWangTiles CurrentChampion 1.png|alt=The definite champion for the largest valid square patch (1 by 1) made by a set of 1 Wang tile.|border|center|frameless]] | |||
|- | |- | ||
|2 | |2 | ||
|2 | |2 | ||
|<code>[1,0,2,0] [2,0,3,0]</code> | |<code>[1,0,2,0] [2,0,3,0]</code> | ||
|[[File:BusyBeaverWangTiles CurrentChampion 2.png|alt=The definite champion for the largest valid square patch (2 by 2) made by a set of 2 Wang tiles.|border|center|frameless]] | |||
|- | |- | ||
|3 | |3 | ||
|3 | |3 | ||
|<code>[1,0,2,0] [2,0,3,0] [3,0,4,0]</code> | |<code>[1,0,2,0] [2,0,3,0] [3,0,4,0]</code> | ||
|[[File:BusyBeaverWangTiles CurrentChampion 3.png|alt=The definite champion for the largest valid square patch (3 by 3) made by a set of 3 Wang tiles.|border|center|frameless]] | |||
|- | |- | ||
|4 | |4 | ||
|4 | |4 | ||
|<code>[1,0,2,0] [2,0,3,0] [3,0,4,0] [4,0,5,0]</code> | |<code>[1,0,2,0] [2,0,3,0] [3,0,4,0] [4,0,5,0]</code> | ||
|[[File:BusyBeaverWangTiles CurrentChampion 4.png|alt=The definite champion for the largest valid square patch (4 by 4) made by a set of 4 Wang tiles.|border|center|frameless]] | |||
|- | |- | ||
|5 | |5 | ||
|≥ 6 | |≥ 6 | ||
|<code>[1,0,2,0] [2,0,3,0] [3,0,4,0] [4,6,1,5] [4,5,2,6]</code> | |<code>[1,0,2,0] [2,0,3,0] [3,0,4,0] [4,6,1,5] [4,5,2,6]</code> | ||
|[[File:BusyBeaverWangTiles CurrentChampion 5.png|alt=The best known champion for the largest valid square patch (6 by 6) made by a set of 5 Wang tiles.|border|center|frameless]] | |||
|- | |- | ||
|6 | |6 | ||
|≥ 8 | |≥ 8 | ||
|<code>[1,0,2,0] [2,0,3,0] [3,0,4,0] [4,0,5,0] [5,7,1,6] [5,6,2,7]</code> | |<code>[1,0,2,0] [2,0,3,0] [3,0,4,0] [4,0,5,0] [5,7,1,6] [5,6,2,7]</code> | ||
|[[File:BusyBeaverWangTiles CurrentChampion 6.png|alt=The best known champion for the largest valid square patch (8 by 8) made by a set of 6 Wang tiles.|border|center|frameless]] | |||
|- | |||
|7 | |||
|≥ 11 | |||
| | |||
|[[File:BusyBeaverWangTiles CurrentChampion 7.png|alt=The best known champion for the largest valid square patch (11 by 11) made by a set of 7 Wang tiles.|border|center|frameless]] | |||
|- | |||
|8 | |||
|≥ 14 | |||
| | |||
|[[File:BusyBeaverWangTiles CurrentChampion 8.png|alt=The best known champion for the largest valid square patch (14 by 14) made by a set of 8 Wang tiles.|border|center|frameless]] | |||
|- | |||
|9 | |||
|≥ 17 | |||
| | |||
|[[File:BusyBeaverWangTiles CurrentChampion 9.png|alt=The best known champion for the largest valid square patch (17 by 17) made by a set of 9 Wang tiles.|border|center|frameless]] | |||
|- | |||
|10 | |||
|≥ 212 | |||
| | |||
| | |||
|} | |} | ||
== Analysis == | |||
TODO | |||
[[Category:Functions]] | |||
[[Category:Stubs]] | |||
Latest revision as of 10:43, 23 August 2026
Wang Tiles (or Wang dominoes) are a class of formal mathematical systems first proposed by Hao Wang in 1961. They consist of equal-sized square tiles with colored edges that are arranged side-by-side on a regular grid.
When placing tiles to cover an infinite plane, you must strictly follow three structural constraints:
- Orientation: Tiles must be placed with a fixed orientation and cannot be rotated or reflected.
- Edge Matching: Adjoining edges of touching tiles must share the exact same color.
- Grid Alignment: Every tile must occupy exactly one square in a standard square grid.
Busy Beaver function
Define the score of a set of Wang tiles as the largest d such that it can tile a dxd square, or 0 if there is no largest d.
Then BBWT(n) = the maximum score over all n-tile sets.
The current format to describe a set of tiles is a list of tuples that have 4 nonegative numbers, each representing a side color. Example: [TOP,RIGHT,BOTTOM,LEFT]
| n | Value | Champion | Image |
|---|---|---|---|
| 1 | 1 | [1,0,0,0]
|
 |
| 2 | 2 | [1,0,2,0] [2,0,3,0]
|
 |
| 3 | 3 | [1,0,2,0] [2,0,3,0] [3,0,4,0]
|
 |
| 4 | 4 | [1,0,2,0] [2,0,3,0] [3,0,4,0] [4,0,5,0]
|
 |
| 5 | ≥ 6 | [1,0,2,0] [2,0,3,0] [3,0,4,0] [4,6,1,5] [4,5,2,6]
|
 |
| 6 | ≥ 8 | [1,0,2,0] [2,0,3,0] [3,0,4,0] [4,0,5,0] [5,7,1,6] [5,6,2,7]
|
 |
| 7 | ≥ 11 |  | |
| 8 | ≥ 14 |  | |
| 9 | ≥ 17 |  | |
| 10 | ≥ 212 |
Analysis
TODO