2525import aima .core .search .uninformed .DepthFirstSearch ;
2626
2727/**
28- * Console application which demonstrates how different search algorithms
28+ * Command line demo which demonstrates how different search algorithms
2929 * solve the n-queens problem.
3030 *
3131 * @author Ruediger Lunde
3232 */
33- public class NQueensSearchProg {
33+ public class NQueensSearchDemo {
3434 private int boardSize = 8 ;
3535 public int populationSize = 10 ;
3636 public double mutationProbability = 0.2 ;
@@ -45,31 +45,31 @@ public class NQueensSearchProg {
4545 private List <ProgressTracer > progressTracers = new ArrayList <>();
4646
4747 public static void main (String [] args ) {
48- NQueensSearchProg prog = new NQueensSearchProg ();
48+ NQueensSearchDemo demo = new NQueensSearchDemo ();
4949 // prog.setBoardSize(32);
50- prog .addProgressTracer (prog ::printProgress );
51-
52- System .out .println ("NQueens depth-first search experiment (boardSize=" + prog .boardSize + ") -->" );
53- prog .initExperiment (Config .EMPTY );
54- prog .startExperiment (new DepthFirstSearch (new TreeSearch ()));
55- prog .printResult ();
56-
57- System .out .println ("NQueens hill climbing search experiment (boardSize=" + prog .boardSize + ") -->" );
58- prog .initExperiment (Config .QUEENS_IN_FIRST_ROW );
59- prog .startHillClimbingExperiment ();
60- prog .printResult ();
61-
62- System .out .println ("NQueens simulated annealing experiment (boardSize=" + prog .boardSize + ", maxIterations="
63- + prog .maxIterations + ") -->" );
64- prog .initExperiment (Config .QUEENS_IN_FIRST_ROW );
65- prog .startSimulatedAnnealingExperiment ();
66- prog .printResult ();
67-
68- System .out .println ("NQueens genetic algorithm experiment (boardSize=" + prog .boardSize + ", popSize="
69- + prog .populationSize + ", mutProb=" + prog .mutationProbability + ") -->" );
70- prog .initExperiment (Config .EMPTY );
71- prog .startGenAlgoExperiment (false );
72- prog .printResult ();
50+ demo .addProgressTracer (demo ::printProgress );
51+
52+ System .out .println ("NQueens depth-first search experiment (boardSize=" + demo .boardSize + ") -->" );
53+ demo .initExperiment (Config .EMPTY );
54+ demo .startExperiment (new DepthFirstSearch (new TreeSearch ()));
55+ demo .printResult ();
56+
57+ System .out .println ("NQueens hill climbing search experiment (boardSize=" + demo .boardSize + ") -->" );
58+ demo .initExperiment (Config .QUEENS_IN_FIRST_ROW );
59+ demo .startHillClimbingExperiment ();
60+ demo .printResult ();
61+
62+ System .out .println ("NQueens simulated annealing experiment (boardSize=" + demo .boardSize + ", maxIterations="
63+ + demo .maxIterations + ") -->" );
64+ demo .initExperiment (Config .QUEENS_IN_FIRST_ROW );
65+ demo .startSimulatedAnnealingExperiment ();
66+ demo .printResult ();
67+
68+ System .out .println ("NQueens genetic algorithm experiment (boardSize=" + demo .boardSize + ", popSize="
69+ + demo .populationSize + ", mutProb=" + demo .mutationProbability + ") -->" );
70+ demo .initExperiment (Config .EMPTY );
71+ demo .startGenAlgoExperiment (false );
72+ demo .printResult ();
7373 }
7474
7575 public void setBoardSize (int size ) {
0 commit comments