Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: It is ll-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete.  show that the same is true for the right tromino and square tetromino on the square lattice, or for the right tromino alone. In the process,  show tthat Monotone 1-in-3 Satisfiability is NP-complete for planar cubic graphs. In higher dimensions,  show NP-completeness for the domino and straight tromino for general regions on the cubic lattice, and for simply-connected regions on the four-dimensional hypercubic lattice.
['Cristopher Moore', 'John Michael Robson']
I am writing a research paper on a idea Hard Tiling Problems with Simple Tiles
[{"from": "human", "value": "I am writing a research paper on a idea Hard Tiling Problems with Simple Tiles"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: It is ll-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete.  show that the same is true for the right tromino and square tetromino on the square lattice, or for the right tromino alone. In the process,  show tthat Monotone 1-in-3 Satisfiability is NP-complete for planar cubic graphs. In higher dimensions,  show NP-completeness for the domino and straight tromino for general regions on the cubic lattice, and for simply-connected regions on the four-dimensional hypercubic lattice."}]