Examples of aima.core.search.uninformed.IterativeDeepeningSearch

aima.core.search.uninformed.IterativeDeepeningSearch
Artificial Intelligence A Modern Approach (3rd Edition): Figure 3.18, page 89.
```
 function ITERATIVE-DEEPENING-SEARCH(problem) returns a solution, or failure for depth = 0 to infinity  do result <- DEPTH-LIMITED-SEARCH(problem, depth) if result != cutoff then return result 
```
Figure 3.18 The iterative deepening search algorithm, which repeatedly applies depth-limited search with increasing limits. It terminates when a solution is found or if the depth- limited search returns failure, meaning that no solution exists. @author Ravi Mohan @author Ciaran O'Reilly

      break;
    case BF_SEARCH:
      result = new BreadthFirstSearch(qs);
      break;
    case ID_SEARCH:
      result = new IterativeDeepeningSearch();
      break;
    case UC_SEARCH:
      result = new UniformCostSearch(qs);
      break;
    case GBF_SEARCH:

View Full Code Here

    try {
      Problem problem = new Problem(new NQueensBoard(8),
          NQueensFunctionFactory.getIActionsFunction(),
          NQueensFunctionFactory.getResultFunction(),
          new NQueensGoalTest());
      Search search = new IterativeDeepeningSearch();
      SearchAgent agent = new SearchAgent(problem, search);


      System.out.println();
      printActions(agent.getActions());
      printInstrumentation(agent.getInstrumentation());

View Full Code Here

    System.out.println("\nEightPuzzleDemo Iterative DLS -->");
    try {
      Problem problem = new Problem(random1, EightPuzzleFunctionFactory
          .getActionsFunction(), EightPuzzleFunctionFactory
          .getResultFunction(), new EightPuzzleGoalTest());
      Search search = new IterativeDeepeningSearch();
      SearchAgent agent = new SearchAgent(problem, search);
      printActions(agent.getActions());
      printInstrumentation(agent.getInstrumentation());
    } catch (Exception e) {
      e.printStackTrace();

View Full Code Here

    try {
      Problem problem = new Problem(new NQueensBoard(8),
          NQueensFunctionFactory.getIActionsFunction(),
          NQueensFunctionFactory.getResultFunction(),
          new NQueensGoalTest());
      Search search = new IterativeDeepeningSearch();
      SearchAgent agent = new SearchAgent(problem, search);
      List<Action> actions = agent.getActions();
      assertCorrectPlacement(actions);
      Assert.assertEquals("3656",
          agent.getInstrumentation().getProperty("nodesExpanded"));

View Full Code Here

TOP

Related Classes of aima.core.search.uninformed.IterativeDeepeningSearch

aima.core.search.framework.Metrics

aima.gui.applications.search.map.SearchFactory

aima.gui.demo.search.EightPuzzleDemo

aima.gui.demo.search.NQueensDemo

aima.test.core.unit.search.uninformed.IterativeDeepeningSearchTest

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.