A Systematic Solution to the (De-)Composition Problem in General Game Playing
Timothy Cerexhe, David Rajaratnam, Abdallah Saffidine, Michael Thielscher · Frontiers in artificial intelligence and applications · 2014
General game players can drastically reduce the cost of search if they are able to solve smaller subproblems individually and synthesise the resulting solutions. To provide a systematic solution to this (de-)composition problem, we start off with generalising the standard decomposition problem in planning by allowing the composition of individual solutions to be further constrained by domain-dependent requirements of the global planning problem. We solve this generalised problem based on a systematic analysis of composition operators for transition systems, and we demonstrate how this solution can be further generalised to general game playing.