missionaries and cannibals heuristic

Question

I want to implement missionaries and cannibals with python with different search algorithms. One of the algorithms is Greedy or A* that needs a heuristic function to work.

I cant think of any correct heuristic to work. Can you suggest a heuristic ?

please make sure to at least try and provide your ideas on how you approached the problem. also, these kind of question might be more relevant at https://cs.stackexchange.com/ — Daniel Dror, Oct 30 '18 at 16:15

score 4 · Accepted Answer · answered Jan 22 '18 at 12:22

4

The correct heuristic function for missionaries and cannibals problem, we assume that in the first place, there are 3 missionaries and 3 cannibals on the left side, so :

h(x) = (cannibalsLeft + missionariesLeft) / 2

answered Jan 22 '18 at 12:22

Amirition

328
5
22

score 0 · Answer 2 · edited Apr 11 '22 at 04:58

0

heuristic = (no. of missionaries at right side + no. of cannibals at right side) – 1

The minus 1 (– 1) in the above expression is important to keep the heuristic function admissible

edited Apr 11 '22 at 04:58

Suraj Rao

29,388
11
94
103

answered Apr 11 '22 at 04:13

brahamjot singh

1

missionaries and cannibals heuristic

2 Answers2