Solving Missionaries and Cannibals Problem with Simulink Design Verifier
Note de l’éditeur : This file was selected as MATLAB Central Pick of the Week
The missionaries and cannibals problem is one of the classic river-crossing problems.
Three missionaries and three cannibals must cross a river using a boat which can carry at most two people, under the constraint that, for both banks, if there are missionaries present on the bank, they cannot be outnumbered by cannibals (if they were, the cannibals would eat the missionaries). The boat cannot cross the river by itself with no people on board.
https://en.wikipedia.org/wiki/Missionaries_and_cannibals_problem
You can use either property proving mode (to generate counter example) or test generation mode (to generate test case directly) of Simulink Design Verifier.
Also a simple script for visualization of results is provided. Cannibals are red squares, missionaries are green circles, the boat is a triangle.
Citation pour cette source
Mikhail (2025). Solving Missionaries and Cannibals Problem with Simulink Design Verifier (https://www.mathworks.com/matlabcentral/fileexchange/61198-solving-missionaries-and-cannibals-problem-with-simulink-design-verifier), MATLAB Central File Exchange. Extrait(e) le .
Compatibilité avec les versions de MATLAB
Plateformes compatibles
Windows macOS LinuxCatégories
- AI and Statistics > Statistics and Machine Learning Toolbox > Regression > Model Building and Assessment > Bayesian Regression >
Tags
Remerciements
Inspiré par : Solving Ferryman Problem with Simuink Design Verifier
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Découvrir Live Editor
Créez des scripts avec du code, des résultats et du texte formaté dans un même document exécutable.
Version | Publié le | Notes de version | |
---|---|---|---|
1.1.0.0 | Use one Scope block for better visualization
|
||
1.0.0.0 |