Python program that implements an agent that can solve Block World problems optimally (in the minimum number of moves) for an arbitrary initial arrangement of blocks (A-Z, 26 blocks maximum) using Generate & Test and Means-Ends Analysis techniques.
Artificial Intelligence Lab
Library implementation for Block World Problem with Goal stack Planning method (IFB-305 Kecerdasan Buatan)
Add a description, image, and links to the block-world-problem topic page so that developers can more easily learn about it.
To associate your repository with the block-world-problem topic, visit your repo's landing page and select "manage topics."