Macro transform approach to solve indecomposable problems

The authors describe a novel approach (the macro transform) for solving indecomposable problems, which cannot be decomposed into a sequence of subgoals before they are solved. This kind of problem cannot be solved by either the GPS (general problem solver) or the MPS (macro-operator problem solver). The diamond game is discussed in detail as an example. The proposed approach has also been successfully applied to solving many other problems, such as the N×M puzzle, N-queens, Hanoi tower, Rubik cube, etc. The macro transform approach is very useful for artificial intelligence and related areas