/// <summary>
/// Small benchmark that creates a 10x10x10 world and then tries to find a path from
/// 0,0,0 to 9,5,8. Benchmark is run 100 times after which benchmark results and the path are shown
/// 1 out 3 nodes in the world are blocked
/// </summary>
static void Main(string[] args)
{
double[] bench = new double[1000];
World world = new World(10, 10, 10);
Random random = new Random();
for (int x = 0; x < world.Right; x++)
{
for (int y = 0; y < world.Top; y++)
{
for (int z = 0; z < world.Back; z++)
{
//prevent the starting square from being blocked
if ((x + y + z) % 3 == 0 && (x + y + z) != 0)
{
world.MarkPosition(new Point3D(x, y, z), true);
}
}
}
}
for (int i = 0; i < bench.Length; i++)
{
DateTime start = DateTime.Now;
PathFinder.FindPath(world, Point3D.Zero, new Point3D(5, 8, 9));
TimeSpan ts = DateTime.Now - start;
bench[i] = ts.TotalMilliseconds;
}
Console.Out.WriteLine("Total time: " + bench.Sum().ToString() + "ms");
Console.Out.WriteLine("Average time: " + bench.Sum() / bench.Length + "ms");
Console.Out.WriteLine("Max: " + bench.Max() + "ms");
Console.Out.WriteLine("Min: " + bench.Min() + "ms");
Console.Out.WriteLine("Output: ");
SearchNode crumb2 = PathFinder.FindPath(world, Point3D.Zero, new Point3D(5, 8, 9));
Console.Out.WriteLine("Start: " + crumb2.position.ToString());
while (crumb2.next != null)
{
Console.Out.WriteLine("Route: " + crumb2.next.position.ToString());
crumb2 = crumb2.next;
}
Console.Out.WriteLine("Finished at: " + crumb2.position.ToString());
Console.ReadLine();
}
