• Data Structures. The state repres

• Data Structures. The state representation of the 8-puzzle 1s close to the representation one could find in a specialized pro­ gram. However, the same cannot be said for Towers of Hanoi. In a specialized program, the state would not be represented by a set of equalities loc(diski) = diskj, but by three lists (disk1 , disk2, .. .) one for each peg, meaning that disk1 is on disk2 which is on disk3 , etc. Then the action of moving a disk from one peg to another would be implemented as operations on the heads of these lists. One way to achieve such efficient representations in FStrips is by al­ lowing Lists as primitive types. Then functions like car, cdr , cons , etc. defined in the underlying language can be made available in the planning language. This would allow high-level representations of Tower of Hanoi and other problems that are as efficient as
specialized representations.

Results (English) 2:

•数据结构。的重排九宫1s接近表示可以在专门的­克找到状态表示。然而，同样不能说河内塔。在一个专门的计划，国家将不会通过一组等式LOC代表（diski）= diskj，而是由三列（DISK1，disk2，..每一个挂钩。），这意味着在disk2 DISK1是disk3，然后移动到另一个磁盘从PEG行动将对这些列表头的操作。在fstrips实现有效的陈述的一种方式是通过降低铝­列为原始类型。然后就像汽车，CDR，缺点，等。在底层语言的定义可以在设计语言的使用。这将使河内和其他问题，如塔
专业高效的高级代表
交涉。