How to solve monkey and banana problem using best-first search algorithm? Anyone having ideas? I know we have to choose a heuristic function 'h(n)' for performing distance related calculations. But can anyone elaborate this problem ? (algorithm and complexity analysis much appreciated)

## griswolf 304

## jwenting 1,649

## rahulrajcse -6

jwenting
commented:
solution to what? -3

Ezzaral
commented:
This is not a homework completion service. Perhaps you should demonstrate a little effort first. -3

## gusano79 247

## jwenting 1,649

## Adarsh_4 -3

Schol-R-LEA
commented:
Try looking at the dates of a thread before replying to something that's been dead for six years. -3