static void Main(string[] args)
{
Vector2 startPoint;
Vector2 endPoint;
string[] mapData;
ErrCode code = ParseArgs(args, out mapData, out startPoint, out endPoint);
if (ErrCode.Success != code)
{
return(code);
}
MapSolution map = new MapSolution(mapData, startPoint, endPoint);
map.ComputePath();
map.DisplayMap();
return(ErrCode.Success);
}
/// <summary>
/// Initializes a new instance of the <see cref="MapSearcher"/> class.
/// </summary>
/// <param name="r">
/// The random to use in searching.
/// </param>
/// <param name="mapSearchOptions">
/// The map options for this search.
/// </param>
/// <param name="noveltySearchOptions">
/// The novelty Search Options.
/// </param>
public MapSearcher(Random r, MapSearchOptions mapSearchOptions, NoveltySearchOptions noveltySearchOptions)
: base(r, noveltySearchOptions)
{
this.MapSearchOptions = mapSearchOptions;
this.FeasiblePopulation = new MapPopulation(true, noveltySearchOptions.FeasiblePopulationSize);
this.InfeasiblePopulation = new MapPopulation(false, noveltySearchOptions.InfeasiblePopulationSize);
this.Archive = new MapNovelArchive();
var numberOfAttempts = 0;
while (this.FeasiblePopulation.CurrentGeneration.Count < noveltySearchOptions.FeasiblePopulationSize)
{
var list = MapConversionHelper.GenerateInitialMapPoints(mapSearchOptions, r);
var ms = new MapSolution(this.MapSearchOptions, this.NoveltySearchOptions, list, r);
if (ms.IsFeasible)
{
this.FeasiblePopulation.CurrentGeneration.Add(ms);
}
else if (InfeasiblePopulation.CurrentGeneration.Count < noveltySearchOptions.InfeasiblePopulationSize)
{
this.InfeasiblePopulation.CurrentGeneration.Add(ms);
}
if (numberOfAttempts > 1000)
{
break;
}
numberOfAttempts++;
}
while (this.InfeasiblePopulation.CurrentGeneration.Count < noveltySearchOptions.InfeasiblePopulationSize)
{
var list = MapConversionHelper.GenerateInitialMapPoints(mapSearchOptions, r);
for (var j = 0; j < list.Count; j++)
{
var item = list[j];
var distance = r.Next(2) == 1 ? (r.Next(2) == 1 ? (item.Distance + 1.0) : (item.Distance - 1.0)) : item.Distance;
var degree = r.Next(2) == 1 ? (r.Next(2) == 1 ? (item.Degree + 180) : (item.Degree - 180)) : item.Degree;
var mp = new MapPoint(distance, degree, item.Type, Enums.WasPlaced.NotAttempted);
list[j] = mp;
}
var ms = new MapSolution(this.MapSearchOptions, this.NoveltySearchOptions, list, r);
this.InfeasiblePopulation.CurrentGeneration.Add(ms);
}
foreach (var ms in this.FeasiblePopulation.CurrentGeneration)
{
var novelty = ms.CalculateNovelty(
this.FeasiblePopulation,
this.Archive,
noveltySearchOptions.NumberOfNeighbours);
if (novelty >= noveltySearchOptions.MinimumNovelty)
{
this.Archive.Archive.Add(ms);
}
}
}
