public void SingleThreadedForwardSolver_TreePoolPerformance()
{
// IDEA: This puzzle has a relatively large amount of FLOOR space, which will create lots of Nodes in the TreePool
// arrange
var solver = new SingleThreadedForwardSolver();
var command = new SolverCommand()
{
Puzzle = new Puzzle(new String[]
{
"##########",
"#O.......#",
"#O.......#",
"#O.......#",
"#....X...#",
"#...XPX..#",
"#........#",
"##########"
}),
Report = Console.Out,
ExitConditions = ExitConditions.OneMinute
};
// act
var result = solver.Init(command) as SolverBase.CommandResult;
solver.Solve(result);
Console.WriteLine(result.ExitDescription);
Console.WriteLine(SolverHelper.Summary(result));
result.ThrowErrors();
// assert
Assert.That(result, Is.Not.Null);
}
public void SingleThreadedForwardSolver_BaseLine_Quick()
{
// arrange
var solver = new SingleThreadedForwardSolver();
var command = new SolverCommand()
{
Puzzle = new Puzzle(),
Report = Console.Out,
ExitConditions = new ExitConditions()
{
Duration = TimeSpan.FromSeconds(10),
StopOnSolution = true,
TotalNodes = 10000
}
};
// act
var result = solver.Init(command) as SolverBase.CommandResult;
solver.Solve(result);
Console.WriteLine(result.ExitDescription);
Console.WriteLine(SolverHelper.Summary(result));
result.ThrowErrors();
// assert
Assert.That(result, Is.Not.Null);
}
public void SingleThreadedForwardSolver_TreePoolPerformance_Large()
{
Console.WriteLine("IDEA: This puzzle has a relatively large amount of FLOOR space, which will create lots of Nodes in the TreePool");
Console.WriteLine("[WILLOW: Started prep for multi-threading] 52000 nodes at 851.658640168867 nodes/sec. Exited EARLY. Time => Nodes: 52000, Dead: 0, Duration: 61.0573269 sec., Duplicates: 236306");
Console.WriteLine("[WILLOW: Collection optimistion] 59000 nodes at 980.895125589307 nodes/sec. Exited EARLY. Time => Nodes: 59000, Dead: 0, Duration: 60.1491418 sec., Duplicates: 274401");
Console.WriteLine("[Added Buffered inserts] 68000 nodes at 1129.36134313775 nodes/sec. Exited EARLY. Time => Nodes: 68000, Dead: 0, Duration: 60.2110214 sec., Duplicates: 476102");
// arrange
var solver = new SingleThreadedForwardSolver();
var command = new SolverCommand()
{
Puzzle = new Puzzle(new String[]
{
"##########",
"#O.......#",
"#O.....X.#",
"#O.......#",
"#........#",
"#........#",
"#....X...#",
"#...XPX..#",
"#....O...#",
"##########"
}),
Report = Console.Out,
ExitConditions = new ExitConditions()
{
Duration = TimeSpan.FromMinutes(1),
TotalNodes = int.MaxValue,
TotalDead = int.MaxValue,
StopOnSolution = false // !!!!!!
},
Progress = new ConsoleProgressNotifier()
};
// act
var result = solver.Init(command) as SolverBase.CommandResult;
solver.Solve(result);
Console.WriteLine(SolverHelper.Summary(result));
result.ThrowErrors();
Console.WriteLine("All Nodes");
Console.WriteLine( (result as SingleThreadedForwardSolver.CommandResult).Pool.ToString());
// assert
Assert.That(result, Is.Not.Null);
}
