Using breadth-first-search, depth-first-search, A* algorithm to solve 8-puzzle-problem and missionaries-cannibals-problem
-
Updated
Aug 14, 2024 - C
Using breadth-first-search, depth-first-search, A* algorithm to solve 8-puzzle-problem and missionaries-cannibals-problem
Solving missionary cannibal problem using different search strategies in C
ECOM 031 - Instituto de Computação UFAL
Add a description, image, and links to the missionaries-cannibals-problem topic page so that developers can more easily learn about it.
To associate your repository with the missionaries-cannibals-problem topic, visit your repo's landing page and select "manage topics."