tex216/Block-World
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.
This helps artificial intelligence researchers and students develop and test planning algorithms. You provide a starting arrangement of blocks (A-Z, up to 26) and a target arrangement. It outputs the shortest possible sequence of moves to transform the initial setup into the goal. Anyone working with AI planning problems, especially in classical planning domains, would find this useful.
No commits in the last 6 months.
Use this if you need an optimal solution to the Block World problem to benchmark your own AI planning algorithms or to study optimal pathfinding.
Not ideal if you're looking for a general-purpose AI planning system for complex, real-world logistical or robotics tasks beyond the Block World domain.
Stars
8
Forks
6
Language
Python
License
—
Last pushed
Aug 28, 2021
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/agents/tex216/Block-World"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
StevenLyt/mapf-visualizer
A Multi-Agent Path Finding visualization website.
mahdirezaie336/GimmeButter
A servant robot trying to serve as fast as possible using A* algorithm.
Zhuagenborn/Chase-AI
🎮 An artificial intelligence game to demonstrate the A* pathfinding. The enemy will try to get...
thundergolfer/the-general-problem-solver
The General Problem Solver, AI's 'first' algorithm, written in multiple programming languages.
Adamouization/AI-Search-Flight-Route-Planner
:airplane: Flight route planning agent using classic AI search algorithms (A*, Best-First, DFS, BFS).