This Python implementation is a scaled up version of the Missionaries and Cannibals problem with arbitary number of missionaries, cannibals and boat capacity
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.
Problema dos canibais e missionários resolvido com o algoritmo de Busca em Largura.
work submitted for AI Lab -fall20
AI Lab Offlines and Onlines
matlab solution for missionaries_and_cannibals_problem
Identifying all pages with cannibalization issues by combining Google Search Console API data according to Levenshtein distance and Jaccard similarity coefficient.
Examples of uninformed (iddfs), infromed (a-star) and local (beam) search.
A generalized version of the problem
Solution to Three missionaries and three cannibals problem
Cannibals & Missionaries Problem Solution with A* Algorithm in Java
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."