Fast recursive formulations for best-first search that allow controlled use of memory

摘要: MREC is a new recursive best-first search algorithm which combines the good features of A* and IDA*. It closer in operation to IDA*, does not use an OPEN list. In order execute, all needs sufficient memory for its implicit stack. But it can also be fed at runtime parameter M tells how much additional available use. this extra memory, stores as possible explicit graph. When = 0, identical when > make far fewer node expansions than This advantageous problems where time expand significant. Extensive runs on variety problems, involving graphs that may or trees, indicate with 0 IDA* such 15- puzzle suitable, while large fast expansion negligible.