此类问题涉及Dominos是否有名字？
我的教授向我展示了我认为很有趣的问题。
问题如下： 如果您有一个2^n x 2^n棋盘，然后从中卸下一个正方形，您是否可以用L形trominos填充它？
答案是肯定的，我认为有趣的方法。
在此示例中，x是删除的正方形，数字表示L-的形状形状的trominos。在Checkerboard的每个可能的置换中，应该有一个解决方案，可以用Trominos填充每个正方形。
有谁知道这种问题是否在数学领域中命名？我想了解更多有关这些的信息。
我还将尝试编程，任何人都有任何有帮助的想法？
There's this problem that my professor showed me that I thought was interesting.
The problem is as follows:
If you have a 2^n by 2^n checkerboard and remove one square from it, will you be able to fill it with L-shaped trominos?
The answer to this is yes, the method of which I thought was interesting.
In this example, X is the removed square and the numbers represent the shape of the L-shaped trominos. In every possible permutation of checkerboards, there should be a solution to fill up every square with trominos.
Does anyone know if this kind of problem is named in a field of math? I'd love to learn more about these.
I'm also going to attempt to program this, anyone have any ideas that could help?
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（1）
有一个广泛的问题家族称为 平铺问题 ，询问何时，以及如何使用固定的数字集合来拼贴不同的形状。
关于 图细分 的其他问题，问题是何时，或如何将一些较大的图形分成各种形状的较小图形。
There's a broad family of problems called tiling problems that ask when, whether, and how to tile different shapes using a fixed collection of figures.
There are other questions about figure subdivisions, where the question is when, whether, or how to subdivide some larger figure apart into smaller figures of various shapes.