atic Reasoning and Cases
Michael Anderson, Robert McCartney · 1996
We believe that many problem domains that lend themselves to a case-based reasoning solution can benefit from an diagrammatic implementation and propose a diagrammatic case-based solution to what we term the n-queens best solution problem where the best solution is defined as that which solves the probfem moving the fewest queens. A working system, based on a novel combination of diagrammatic and case-based reasoning, is described. the problem in the fewest moves). Further, we develop an inter-diagrammatic implementation of the min-conflicts heuristic [Gu 1989-J to find solutions to randomly chosen n-queens problems [Stone & Stone 19861 themselves.