Uses A* search to find an optimal sequence of tetromino placements from a start position to a target position, avoiding obstacles.
-
Updated
Apr 5, 2025 - C++
Uses A* search to find an optimal sequence of tetromino placements from a start position to a target position, avoiding obstacles.
Add a description, image, and links to the bit-grid topic page so that developers can more easily learn about it.
To associate your repository with the bit-grid topic, visit your repo's landing page and select "manage topics."