[rules-users] Non Spatial Map Reduce

I was reading the blog http://www.optaplanner.org/blog/2014/03/03/CanMapReduceSolvePlanningProbl... and although the unsuitability of the spatial division of the problem makes sense, I'd like to understand why the problem can't be broken up differently. i.e. why can't any solution be loaded into n separate solvers with 1/nth of the moves, and then send the best solution to all the solvers, and repeat? -- View this message in context: http://drools.46999.n3.nabble.com/Non-Spatial-Map-Reduce-tp4028652.html Sent from the Drools: User forum mailing list archive at Nabble.com.