Solving missionary cannibal problem using different search strategies in C
-
Updated
Feb 24, 2022 - C
Solving missionary cannibal problem using different search strategies in C
Project for the Artificial Intelligence course @cse.uoi.gr
Implementations of A* and Uniform Cost Search (UCS) algorithms in C for finding the shortest path in grid-based environments with free and blocked nodes.
Add a description, image, and links to the uniform-cost-search topic page so that developers can more easily learn about it.
To associate your repository with the uniform-cost-search topic, visit your repo's landing page and select "manage topics."