public AlgoWayOptimizer(GameState gs, AlgoDummy algo)
{
LinkPlan nwLink = new LinkPlan(gs.PortalInfos.Count);
for (int i = 0; i < gs.PortalData.Count; i++)
{
foreach (KeyValuePair <int, bool> link in gs.PortalData[i].SideLinks)
{
if (link.Value)
{
nwLink.addLink(i, link.Key);
}
}
}
init(gs, nwLink, algo);
}
internal override GameState getBestGame(GameState gs)
{
Random r = new Random(0);
List <PointD> allPoints = new List <PointD>();
index = new Dictionary <PointD, int>();
for (int i = 0; i < gs.PortalInfos.Count; i++)
{
PortalInfo pInfo = gs.PortalInfos[i];
allPoints.Add(pInfo.Pos);
index[pInfo.Pos] = i;
}
List <PointD> remPoints = new List <PointD>(allPoints);
List <PointD> hull = ConvexHull.MakeConvexHull(allPoints);
foreach (PointD item in hull)
{
remPoints.Remove(item);
}
LinkPlan linkPlan = new LinkPlan(gs.PortalInfos.Count);
for (int i = 0; i < hull.Count; i++)
{
//gs.addLink(index[hull[(i - 1 + hull.Count) % hull.Count]], index[hull[i]]);
linkPlan.addLink(index[hull[(i - 1 + hull.Count) % hull.Count]], index[hull[i]]);
}
while (hull.Count > 3)
{
int mid = r.Next(0, hull.Count);
int ind1 = (mid - 1 + hull.Count) % hull.Count;
int ind2 = (mid + 1 + hull.Count) % hull.Count;
//gs.addLink(index[hull[ind1]], index[hull[ind2]]);
linkPlan.addLink(index[hull[ind1]], index[hull[ind2]]);
hull.RemoveAt(mid);
}
List <Triangle> remTriangles = new List <Triangle>();
for (int p1 = 0; p1 < linkPlan.Portals.Length; p1++)
{
foreach (int p2 in linkPlan.Portals[p1].Links)
{
foreach (int p3 in linkPlan.Portals[p2].Links)
{
if (linkPlan.Portals[p3].Links.Contains(p1))
{
int[] triangleKey = new int[] { p1, p2, p3 };
Array.Sort(triangleKey);
Triangle newTr = new Triangle(triangleKey);
if (remTriangles.Contains(newTr))
{
continue;
}
remTriangles.Add(newTr);
}
}
}
}
while (remTriangles.Count > 0)
{
Triangle curTriangle = remTriangles[0];
remTriangles.RemoveAt(0);
foreach (PointD remPoint in remPoints)
{
if (geohelper.PointInPolygon(new PointD[] { allPoints[curTriangle.P1], allPoints[curTriangle.P2], allPoints[curTriangle.P3] }, remPoint))
{
linkPlan.addLink(curTriangle.P1, index[remPoint]);
linkPlan.addLink(curTriangle.P2, index[remPoint]);
linkPlan.addLink(curTriangle.P3, index[remPoint]);
for (int i = 0; i < 3; i++)
{
int[] triangleKey = new int[] { curTriangle.P1, curTriangle.P2, curTriangle.P3 };
triangleKey[i] = index[remPoint];
Array.Sort(triangleKey);
Triangle newTr = new Triangle(triangleKey);
remTriangles.Add(newTr);
}
remPoints.Remove(remPoint);
break;
}
}
}
AlgoWayOptimizer wopt = new AlgoWayOptimizer(gs, linkPlan, this);
gs = wopt.linkConvex();
this.newBestGame(gs);
return(gs);
}
private GameState link(List <int> portalOrder, LinkPlan linkPlan, bool ignoreOutgoingLinks)
{
GameState ret = gs.DeepClone();
ret.loadPortals(gs.PortalInfos);
if (ignoreOutgoingLinks)
{
ret.MaxOutgoingLinksAllowed = 10000;
}
List <int> capturedPortals = new List <int>();
LinkPlan alreadyLinked = new LinkPlan(linkPlan.Portals.Length);
List <int> remPortals = new List <int>(portalOrder);
while (remPortals.Count > 0)
{
int lowest = remPortals[0];
remPortals.RemoveAt(0);
SortedList <double, Triangle> triangleSize = new SortedList <double, Triangle>();
foreach (int cap in capturedPortals)
{
if (linkPlan.Portals[cap].Links.Contains(lowest))
{
alreadyLinked.addLink(lowest, cap);
}
}
foreach (int p2 in alreadyLinked.Portals[lowest].Links)
{
foreach (int p3 in alreadyLinked.Portals[p2].Links)
{
if (alreadyLinked.Portals[p3].Links.Contains(lowest))
{
int[] triangleKey = new int[] { lowest, p2, p3 };
Array.Sort(triangleKey);
Triangle newTr = new Triangle(triangleKey);
double size = geohelper.calculateArea(ret, new Field(newTr.P1, newTr.P2, newTr.P3));
size = 1 / size;
if (triangleSize.ContainsKey(size))
{
continue;
}
triangleSize.Add(size, newTr);
}
}
}
foreach (Triangle item in triangleSize.Values)
{
if (ret.addLink(lowest, item.P1))
{
linkPlan.removeLink(lowest, item.P1);
}
if (ret.addLink(lowest, item.P2))
{
linkPlan.removeLink(lowest, item.P2);
}
if (ret.addLink(lowest, item.P3))
{
linkPlan.removeLink(lowest, item.P3);
}
}
foreach (int cap in capturedPortals)
{
if (linkPlan.Portals[cap].Links.Contains(lowest))
{
if (ret.addLink(lowest, cap))
{
linkPlan.removeLink(lowest, cap);
}
else
{
}
}
}
remPortals.Remove(lowest);
capturedPortals.Add(lowest);
}
return(ret);
}