← Complete problem index

PROJECT EULER · #0594

Rhombus Tilings

Statement only · UnsolvedOriginal problem ↗

For a polygon P, let t(P) be the number of ways in which P can be tiled using rhombi and squares with edge length 1. Distinct rotations and reflections are counted as separate tilings.

For example, if O is a regular octagon with edge length 1, then t(O)=8. As it happens, all these 8 tilings are rotations of one another:

0594_octagon_tilings_1.png

Let Oa,b be the equal-angled convex octagon whose edges alternate in length between a and b.
For example, here is O2,1, with one of its tilings:

0594_octagon_tilings_2.png

You are given that t(O1,1)=8, t(O2,1)=76 and t(O3,2)=456572.

Find t(O4,2).

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.