Examples of uninformed (iddfs), infromed (a-star) and local (beam) search.
-
Updated
May 10, 2020 - Python
Examples of uninformed (iddfs), infromed (a-star) and local (beam) search.
Identifying all pages with cannibalization issues by combining Google Search Console API data according to Levenshtein distance and Jaccard similarity coefficient.
This repo holds the implementation of AI Problems such as Cannibals and Missionaries, N-Queens. Machine Learning algorithms such as Naive Bayes and Logistic Regression also implemented from scratch.
matlab solution for missionaries_and_cannibals_problem
Solution to Three missionaries and three cannibals problem
Cannibals & Missionaries Problem Solution with A* Algorithm in Java
Semantic Nets for Sheep and Wolves Problem
A simple Qt application for The Missionaries and Cannibals Problem
A generalized version of the problem
work submitted for AI Lab -fall20
Problema dos canibais e missionários resolvido com o algoritmo de Busca em Largura.
AI Lab Offlines and Onlines
This Python implementation is a scaled up version of the Missionaries and Cannibals problem with arbitary number of missionaries, cannibals and boat capacity
Add a description, image, and links to the cannibals-problem topic page so that developers can more easily learn about it.
To associate your repository with the cannibals-problem topic, visit your repo's landing page and select "manage topics."