Monkey and banana problem

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Template:Short description The monkey and banana problem is a famous toy problem in artificial intelligence, particularly in logic programming and planning. It has been framed as:

<templatestyles src="Template:Blockquote/styles.css" />

A monkey is in a room containing a box and a bunch of bananas. The bananas are hanging from the ceiling out of reach of the monkey. How can the monkey obtain the bananas?<ref>Template:Cite book</ref>{{#if:|

|}}{{#if:|

}}{{#invoke:Check for unknown parameters|check|unknown=Template:Main other|preview=Page using Template:Blockquote with unknown parameter "_VALUE_"|ignoreblank=y| 1 | 2 | 3 | 4 | 5 | author | by | char | character | cite | class | content | multiline | personquoted | publication | quote | quotesource | quotetext | sign | source | style | text | title | ts }}

The situation is used as a toy problem for computer science and can be solved with an expert system such as CLIPS. The example set of rules that CLIPS provides is somewhat fragile, in that, naive changes to the rulebase that might seem to a human of average intelligence to make common sense can cause the engine to fail to get the monkey to reach the banana.<ref>https://sourceforge.net/projects/clipsrules/files/CLIPS/6.30/examples_630.zip/download See file mab.clp</ref>

Other examples exist using Rules Based System (RBS), including a project implemented in Python.<ref>Monkey and Banana Problem solved using RBS</ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

See also

References

<references />