OnlineSearchProblem simplified.
@@ -45,15 +45,4 @@ public interface OnlineSearchProblem<S, A> {
* <code>stateDelta</code> denoted by c(s, a, s').
*/
double getStepCosts(S state, A action, S stateDelta);
-
- /**
- * Tests whether a node represents an acceptable solution. The default implementation
- * delegates the check to the goal test. Other implementations could make use of the additional
- * information given by the node (e.g. the sequence of actions leading to the node). A
- * solution tester implementation could for example always return false and internally collect
- * the paths of all nodes whose state passes the goal test.
- */
- default boolean testSolution(Node<S, A> node) {
- return testGoal(node.getState());
- }
}
\ No newline at end of file
