Package aima.core.search.framework

Examples of aima.core.search.framework.SearchAgent

22
23
24
25
26
27
28
29
30
31
32
33
34
    Problem problem = new Problem(new NQueensBoard(8),
        NQueensFunctionFactory.getIActionsFunction(),
        NQueensFunctionFactory.getResultFunction(),
        new NQueensGoalTest());
    Search search = new BreadthFirstSearch(new TreeSearch());
    SearchAgent agent = new SearchAgent(problem, search);
    List<Action> actions = agent.getActions();
    assertCorrectPlacement(actions);
    Assert.assertEquals("1665",
        agent.getInstrumentation().getProperty("nodesExpanded"));
    Assert.assertEquals("8.0",
        agent.getInstrumentation().getProperty("pathCost"));
  }
View Full Code Here
38
39
40
41
42
43
44
45
46
47
48
49
50
    Problem problem = new Problem(new NQueensBoard(3),
        NQueensFunctionFactory.getIActionsFunction(),
        NQueensFunctionFactory.getResultFunction(),
        new NQueensGoalTest());
    Search search = new BreadthFirstSearch(new TreeSearch());
    SearchAgent agent = new SearchAgent(problem, search);
    List<Action> actions = agent.getActions();
    Assert.assertEquals(0, actions.size());
    Assert.assertEquals("6",
        agent.getInstrumentation().getProperty("nodesExpanded"));
    Assert.assertEquals("0",
        agent.getInstrumentation().getProperty("pathCost"));
  }
View Full Code Here
22
23
24
25
26
27
28
29
30
31
32
    Problem problem = new Problem(new NQueensBoard(8),
        NQueensFunctionFactory.getIActionsFunction(),
        NQueensFunctionFactory.getResultFunction(),
        new NQueensGoalTest());
    Search search = new DepthFirstSearch(new GraphSearch());
    SearchAgent agent = new SearchAgent(problem, search);
    List<Action> actions = agent.getActions();
    assertCorrectPlacement(actions);
    Assert.assertEquals("113",
        agent.getInstrumentation().getProperty("nodesExpanded"));
  }
View Full Code Here
36
37
38
39
40
41
42
43
44
45
46
    Problem problem = new Problem(new NQueensBoard(3),
        NQueensFunctionFactory.getIActionsFunction(),
        NQueensFunctionFactory.getResultFunction(),
        new NQueensGoalTest());
    Search search = new DepthFirstSearch(new GraphSearch());
    SearchAgent agent = new SearchAgent(problem, search);
    List<Action> actions = agent.getActions();
    Assert.assertEquals(0, actions.size());
    Assert.assertEquals("6",
        agent.getInstrumentation().getProperty("nodesExpanded"));
  }
View Full Code Here
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
      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"));

    } catch (Exception e) {
      e.printStackTrace();
      Assert.fail("Exception should not occur");
    }
View Full Code Here
21
22
23
24
25
26
27
28
29
30
31
    Problem problem = new Problem(new NQueensBoard(8),
        NQueensFunctionFactory.getIActionsFunction(),
        NQueensFunctionFactory.getResultFunction(),
        new NQueensGoalTest());
    Search search = new DepthLimitedSearch(8);
    SearchAgent agent = new SearchAgent(problem, search);
    List<Action> actions = agent.getActions();
    assertCorrectPlacement(actions);
    Assert.assertEquals("113",
        agent.getInstrumentation().getProperty("nodesExpanded"));
  }
View Full Code Here
35
36
37
38
39
40
41
42
43
    Problem problem = new Problem(new NQueensBoard(8),
        NQueensFunctionFactory.getIActionsFunction(),
        NQueensFunctionFactory.getResultFunction(),
        new NQueensGoalTest());
    DepthLimitedSearch search = new DepthLimitedSearch(1);
    SearchAgent agent = new SearchAgent(problem, search);
    List<Action> actions = agent.getActions();
    Assert.assertEquals(true, search.isCutOff(actions));
  }
View Full Code Here
47
48
49
50
51
52
53
54
55
    Problem problem = new Problem(new NQueensBoard(3),
        NQueensFunctionFactory.getIActionsFunction(),
        NQueensFunctionFactory.getResultFunction(),
        new NQueensGoalTest());
    DepthLimitedSearch search = new DepthLimitedSearch(5);
    SearchAgent agent = new SearchAgent(problem, search);
    List<Action> actions = agent.getActions();
    Assert.assertEquals(true, search.isFailure(actions));
  }
View Full Code Here
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
          EightPuzzleFunctionFactory.getActionsFunction(),
          EightPuzzleFunctionFactory.getResultFunction(),
          new EightPuzzleGoalTest());
      Search search = new AStarSearch(new GraphSearch(),
          new ManhattanHeuristicFunction());
      SearchAgent agent = new SearchAgent(problem, search);
      Assert.assertEquals(23, agent.getActions().size());
      Assert.assertEquals("926",
          agent.getInstrumentation().getProperty("nodesExpanded"));
      Assert.assertEquals("534",
          agent.getInstrumentation().getProperty("queueSize"));
      Assert.assertEquals("535",
          agent.getInstrumentation().getProperty("maxQueueSize"));
    } catch (Exception e) {
      e.printStackTrace();
      Assert.fail("Exception thrown");
    }
  }
View Full Code Here
70
71
72
73
74
75
76
77
78
79
80
81
82
        new MapStepCostFunction(romaniaMap));

    Search search = new AStarSearch(new GraphSearch(),
        new StraightLineDistanceHeuristicFunction(
            SimplifiedRoadMapOfPartOfRomania.BUCHAREST, romaniaMap));
    SearchAgent agent = new SearchAgent(problem, search);

    List<Action> actions = agent.getActions();

    Assert.assertEquals(
        "[Action[name==moveTo, location==RimnicuVilcea], Action[name==moveTo, location==Pitesti], Action[name==moveTo, location==Bucharest]]",
        actions.toString());
    Assert.assertEquals("278.0",
View Full Code Here
TOP

Related Classes of aima.core.search.framework.SearchAgent

  • aima.gui.applications.search.games.EightPuzzleApp$EightPuzzleController
  • aima.gui.applications.search.games.NQueensApp$NQueensController
  • aima.gui.demo.search.EightPuzzleDemo
  • aima.gui.demo.search.NQueensDemo
  • aima.test.core.unit.search.framework.SolutionCheckerTest
  • aima.test.core.unit.search.informed.AStarSearchTest
  • aima.test.core.unit.search.informed.GreedyBestFirstSearchTest
  • aima.test.core.unit.search.uninformed.BreadthFirstSearchTest
  • aima.test.core.unit.search.uninformed.DepthFirstSearchTest
  • aima.test.core.unit.search.uninformed.DepthLimitedSearchTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.