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)
rahulrajcse -6 Newbie Poster
Recommended Answers
Jump to Postshoot the monkey, then eat the banana.
Problem solved :)
Jump to PostThe first step in solving that problem is to know what the problem is. I know of at least three different problems that mention a monkey and a banana.
No one knows the solution? I want detailed information about the complexity & heuristic function which we have to choose for …
All 6 Replies
griswolf 304 Veteran Poster
jwenting 1,905 duckman Team Colleague
rahulrajcse -6 Newbie Poster
Ezzaral commented: This is not a homework completion service. Perhaps you should demonstrate a little effort first. -3
jwenting commented: solution to what? -3
gusano79 247 Posting Shark
jwenting 1,905 duckman Team Colleague
Adarsh_4 -3 Newbie Poster
Schol-R-LEA commented: Try looking at the dates of a thread before replying to something that's been dead for six years. -3
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.