Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  prove  PSPACE -completeness of a broad class of moving-blocks problems similar to the ll-known puzzle Sokoban. Several computational complexity results are known for moving-blocks problems. Hover, most of the literature is focused on problems with push moves and the complexity of many of them are still open. In this article,  study the computational complexity of moving-blocks problems with pull moves and problems with push and pull moves. Our reductions are from Nondeterministic Constraint Logic.  improve the known  NP -hardness results of  Pull  problems to  PSPACE -completeness results.  also re able to show that the whole class of  PushPull  problems is  PSPACE -complete.
['André Grahl Pereira', 'Marcus Ritt', 'Luciana S. Buriol']
I am writing a research paper on a idea Pull and PushPull are PSPACE-complete
[{"from": "human", "value": "I am writing a research paper on a idea Pull and PushPull are PSPACE-complete"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  prove  PSPACE -completeness of a broad class of moving-blocks problems similar to the ll-known puzzle Sokoban. Several computational complexity results are known for moving-blocks problems. Hover, most of the literature is focused on problems with push moves and the complexity of many of them are still open. In this article,  study the computational complexity of moving-blocks problems with pull moves and problems with push and pull moves. Our reductions are from Nondeterministic Constraint Logic.  improve the known  NP -hardness results of  Pull  problems to  PSPACE -completeness results.  also re able to show that the whole class of  PushPull  problems is  PSPACE -complete."}]