实现一个解汉诺塔的实用推理Agent

Achieveing an Applied and Rational Agent Which Can Solve the Hanoi Towers

汉诺塔游戏是一个十分古老的游戏,用一个实用推理Agent来解汉诺塔也就是要规划Agent做出决定的过程。这将是一个循环过程,在循环过程中Agent将不断的根据汉诺塔的不同来做出相应的反应并更新自己的信念,以找出实现解汉诺塔的最佳规划。本文主要利用解决汉诺塔问题时所使用的规划技术,给出了一个实用推理Agent的控制结构。

The game of Hanoi Towers is an old game and solving the problem of the Hanoi Towers with an applied and rational agent is a process of making a decision by programming agent. This will be a circular process in which the agent will make different reaetions on the basis of different Hanoi Towers and update it＇s state in order to carry out a programming which can solve the Hanoi Towers best. This artiele proposed a practical reasoning Agent control structure mainly using planning techniques whieh we use when resolving the Hanoi Towers.