说明：  过河问题大家都知道,不多说了. 解决这个问题的经典方法就是使用有限状态机. 根据人,狼,羊,菜,在不同河岸,可以抽象出N种不同的状态.某些状态之间可以转换. 这些转换就是运算了. 我们的目的就是找到一组这样的运算,可以从初始状态转换到终止状态. 其间的状态必需都是合法的
(Issues across the river we all know, not much to say. To solve this problem is to use the classic method of finite state machine. According to people, the wolf, sheep, vegetables, in different bank, you can abstract out of N different types of state. Some state can be converted between. These converters is the operator of the. Our aim is to find a group of such operations, from initial state to switch to terminate the state. which are necessary for the legitimate status of the)