I came up with the idea the day before yesterday, but I couldnāt find time to write the code, so I finally did it now. If the width of the road is 1 and the smallest square is golden ratio (approx. 1.6180339887) g, there are only three ways to arrange squares of size g^n: g^1, g^3 and g^4. So I thought of tiling to fill the given rectangle with these three types of squares. Of course, if there is no other evaluation function, it is possible to fill up the space by lining up squares of the smallest size, etc. Therefore, we decided to use the evaluation function ā1 point is deducted when squares of the same size are lined upā. The above figure is still in the process of calculation, so a large square is lined up in the upper left corner. 9x7 would look like this.
When I showed it to my wife when she got home, she said it looked like pigās feetā¦ If you paint colors randomly, it looks like this, but it would be better to choose four colors and paint them so that they are not adjacent to each other.
Related Ruzinās problem.
- This one has only one square of the same size instead of zero road thickness.
This page is auto-translated from /nishio/é»éęÆč”č·Æćæć¤ćŖć³ć° using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. Iām very happy to spread my thought to non-Japanese readers.