September 2009
An exhaustive algorithm for finding mixed tilings
Step 1 Let be either 3, 4, 5, or 6. Step 2 Set Step 3 Set to be the biggest whole number less than or equal to . Note that not all can be bigger than , for otherwise
Step 1 Let be either 3, 4, 5, or 6. Step 2 Set Step 3 Set to be the biggest whole number less than or equal to . Note that not all can be bigger than , for otherwise