How many different ways are there to fully tile a 2n x 2n grid with dominoes? Here "different" means apparently different. Further, how many unique ways are there? Here "unique" excludes all redundant configurations that are rotations and/or reflections of another. Find the different and unique ways up to 2n=8.
(In reply to
Abbreviated solution by FrankM)
Pasting squares together into larger squares does not produce all the solutions. E.g., solutions include dominoes which lie across these "inner square" boundaries.
Edited on May 28, 2019, 3:54 am
re: Abbreviated solution
