![]() ![]() If the input equals 1, then that person is to board the boat and travel to the other side of the river. If the input equals 0, then that person is to stay put. There are 6 inputs to the model that correspond to a command to move the 6 individuals. He achieves this by creating a model of the problem in Simulink. But rather than manually determining a viable sequence of boat movements, Mikhail relies on Simulink Design Verifier to uncover a solution. Is it possible to get everyone to the other side without a fatality? Yes, indeed. But these missionaries aren’t total pushovers and are only at risk of becoming dinner when outnumbered on one of the riverbanks. Second, cannibals like to eat missionaries whenever possible. First, the boat can transport no more than 2 people and must always have 1 person on board to operate it. ![]() The goal is to get everyone from one side to the other, but there are some catches. The contribution’s description explains that the Missionaries and Cannibals problem is a classic puzzle in which you must use a boat to shuttle 3 missionaries and 3 cannibals across a river. Mikhail’s work manages to combine these ideas together into one novel demonstration. It’s not often I see a File Exchange contribution that involves Simulink Design Verifier and even rarer that I find one with cannibals. Will‘s pick this week is Solving Missionaries and Cannibals Problem with Simulink Design Verifier by Mikhail.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |