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.

21
/ 100
Experimental

No commits in the last 6 months.

No License Stale 6m No Package No Dependents
Maintenance 0 / 25
Adoption 4 / 25
Maturity 1 / 25
Community 16 / 25

How are scores calculated?

Stars

8

Forks

6

Language

Python

License

—

Category

pathfinding-algorithm-implementations

Last pushed

Aug 28, 2021

Commits (30d)

0

GitHub
Pathfinding Algorithm Implementations · 90 frameworks

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/tex216/Block-World"

Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.

Higher-rated alternatives

forestagostinelli/deepxube

Learn a domain-specific heuristic function in a domain-independent fashion to solve pathfinding problems.

51

FK04/AI_Lab

AI lab implementations covering informed and uninformed search algorithms with classic...

32

misaghsoltani/DeepCubeAI

Learning Discrete World Models for Heuristic Search

32

algoprog/Laby

Maze generator, editor & solver in Java

28

VedantKhairnar/The-Maze-Runner

AI : Use of Greedy Best First Search Traversal to find route from Source to Destination in a Random Maze

27

Explore ML Frameworks

All categories Trending ML Framework directory Insights