-
Updated
Jun 10, 2024 - Jupyter Notebook
#
a-star-search-algorithm
Here are 3 public repositories matching this topic...
This code provides a solution for cryptarithmetic puzzles using two different approaches: DFS and A Star Search Algorithm. Cryptarithm puzzles are mathematical puzzles where the digits are replaced by letters of the alphabet, and each letter represents a unique digit.
python
jupyter-notebook
priority-queue
constraint-satisfaction-problem
backtracking
dfs-algorithm
a-star-search-algorithm
-
Updated
Jun 18, 2024 - Jupyter Notebook
8-puzzle implementation in Python using State space search algorithms
python3
a-star
beam-search
hill-climbing-search
8-puzzle
branch-and-bound
heuristic-search-algorithms
state-space-search
best-first-search
bidirectional-search
bfs-search
8-puzzle-problem
8-puzzle-game
dfid-algorithm
a-star-search-algorithm
8-puzzle-bfs
-
Updated
Jul 30, 2024 - Python
Improve this page
Add a description, image, and links to the a-star-search-algorithm topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the a-star-search-algorithm topic, visit your repo's landing page and select "manage topics."