misaghsoltani/DeepCubeAI
Learning Discrete World Models for Heuristic Search
This algorithm helps solve complex sequential decision-making problems, like those found in advanced puzzles or logistics. It takes an initial problem state and a desired goal state as input, then determines the optimal sequence of actions to reach that goal. This is ideal for researchers and practitioners in fields requiring intelligent agents to navigate and solve problems in discrete environments.
No commits in the last 6 months. Available on PyPI.
Use this if you need an AI to efficiently find solutions for problems that involve a series of steps in a clearly defined, changeable environment, such as robotic pathfinding or game AI.
Not ideal if your problem involves continuous, unstructured data or situations where the 'rules' of the world are constantly ambiguous or unknown.
Stars
10
Forks
1
Language
Python
License
MIT
Last pushed
Aug 28, 2025
Commits (30d)
0
Dependencies
7
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/misaghsoltani/DeepCubeAI"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Compare
Higher-rated alternatives
forestagostinelli/deepxube
Learn a domain-specific heuristic function in a domain-independent fashion to solve pathfinding problems.
FK04/AI_Lab
AI lab implementations covering informed and uninformed search algorithms with classic...
algoprog/Laby
Maze generator, editor & solver in Java
tekian/path-finder
Visualization tool to demonstrate how different search algorithms work.
PiSimo/Mens
Brain game that tries to spot signs of memory leak like alzheimer (with Neural Networks).