This jupyter notebook provides a solution for cryptarithmetic puzzles using two different approaches: Depth-First Search (DFS) and A* Search Algorithm. Cryptarithm puzzles are mathematical puzzles where the digits are replaced by letters of the alphabet, and each letter represents a unique digit. The objective is to find the digit corresponding to each letter to satisfy the given arithmetic equation.
Provides a method to solve puzzles by exploring all possible mappings of letters to digits in a depth-first manner.
Utilizes a heuristic-driven approach to efficiently explore possible mappings and find a solution.
Includes functionality to evaluate and print the solution in a human-readable format.
- Python
- jupyter notebook
- heapq
- itertools