public static bool isOccupied(Location l, IPirateGame game, bool dontHitEnemies) { if (contains(l)) { return(true); } else { foreach (Pirate p in game.AllMyPirates()) { if (!contains(p) && p.TurnsToRevive == 0 && l.Equals(p.Location)) { return(true); } } if (dontHitEnemies) // ASSUMING THEY DONT MOVE!!! { foreach (Pirate p in game.AllEnemyPirates()) { if (p.TurnsToRevive == 0 && l.Equals(p.Location)) { return(true); } } } } return(false); }
public static void doAttacks(IPirateGame game, bool deadMap) { if (shot != null) { game.Debug("can only call doAttacks(IPirateGame) once per turn!"); return; } shot = new List <Pirate>(); foreach (Pirate p in targetMap.Keys) { foreach (PirateContainer c in targetMap[p]) { game.Debug(p.Id + " --> " + c.P.Id); } } for (int i = 1; i <= game.AllMyPirates().Count&& targetMap.Keys.Count > 0; i++) { List <Pirate> removed = new List <Pirate>(); foreach (Pirate p in targetMap.Keys) { if (targetMap[p].Count == i && p.DefenseExpirationTurns == 0 && (!deadMap || p.HasTreasure)) { PirateContainer pc = targetMap[p][0]; pc.attack(p, game); removed.Add(p); foreach (Pirate k in targetMap.Keys) { targetMap[k].Remove(pc); } } } foreach (Pirate p in removed) { targetMap.Remove(p); } } /*for (int i = 0; i < queued.Count; i++) * { * if (queued[i].E.Count == 1 && !shot.Contains(queued[i].E[0])) * { * queued[i].P.attack(queued[i].E[0], game);// TODO: if kamikaze, and my target, ignore it * shot.Add(queued[i].E[0]); * } * }*/ }
private void chooseMap(IPirateGame game) { string ts = ""; foreach (Treasure t in game.Treasures()) { ts += t.ToString(); } int map = string.Format("{0}{1}{2}{3}", new object[] { game.Treasures().Count, ts, game.GetRows(), game.GetCols() }).GetHashCode(); game.Debug("Map: " + map); Location l = new Location(1, 1); deadMap = (game.Treasures().Count == 1 && game.AllMyPirates().Count == game.AllEnemyPirates().Count); if (map == -918018829 || game.Treasures().Count < 2) { deadMap = true; } if (!deadMap) { rand = new Random(101010); //79409223);//12486534 } else { rand = new Random(12486534); } game.Debug((deadMap ? "Loaded deadmap config" : "Not the deadmap")); if (map == 1512814401 || deadMap) { throw new Exception("First turn skipped"); } } //chooses map
// this is the actual turn public void DoTurn(IPirateGame game) { if (game.GetTurn() == 1) { rand = new Random(42934837); //,,79409223 if (game.AllEnemyPirates().Count > game.AllMyPirates().Count) { rand = new Random(31400000); } Location l = new Location(1, 1); if (game.Treasures().Count == 1 && game.AllMyPirates().Count == game.AllEnemyPirates().Count) { deadMap = true; } game.Debug((deadMap ? "DEADMAP!!!" : "NIE!")); if (deadMap) { return; // this stops some fighting over treasures } } nowhere = (game.GetEnemyScore() == game.GetMyScore() && game.GetTurn() == (game.GetMaxTurns() / 3)); if (nowhere) { game.Debug("ACTIVATING NOWHERE MODE!!!"); } panic = (((game.Treasures().Count == 0 || game.GetEnemyScore() >= (game.GetMaxPoints() - 2))) && game.EnemyPiratesWithTreasures().Count > 0); if (panic) { game.Debug("ACTIVATING PANIC MODE!!!"); } PirateContainer.init(game); QueuedAttack.init(); QueuedMotion.init(); int remaining = game.GetActionsPerTurn(); int ships = game.AllMyPirates().Count; try { // calculate the closest treasure to ps[i] PirateContainer[] ps = new PirateContainer[ships]; int[] ds = new int[ships]; Treasure[] ts = new Treasure[ships]; for (int i = 0; i < ships; i++) { ps[i] = new PirateContainer(game.GetMyPirate(i), (i % 2) == 1); ds[i] = int.MaxValue; foreach (Treasure t in game.Treasures()) { if (game.Distance(ps[i].P, t) < ds[i]) { ds[i] = game.Distance(ps[i].P, t); ts[i] = t; } } } // control the kamikazes calcKamikazes(ps, ref ts, ref ds, game); // move Pirates that have treasures towards the base { List <PirateContainer> ltp = PirateContainer.withTreasure; foreach (PirateContainer p in ltp) { List <Pirate> es = findEnemiesFor(p.P, game); if (es.Count > 0 && p.P.ReloadTurns == 0) { p.defend(game); } else { remaining -= move(p, p.P.InitialLocation, 1, game, true); } } } // search and destroy, TODO: prioritise this!!! Pirate k = null, tar = null; if (panic) { int mx = (game.GetRows() + game.GetCols() - game.GetAttackRadius()) / game.GetActionsPerTurn(); // turns it takes to get from a corner to its opposing corner int d = int.MaxValue; tar = game.EnemyPiratesWithTreasures()[0]; // TODO: focus on closest to enemy base // find closest Pirate foreach (PirateContainer p in PirateContainer.free) // notice all pirates with Treasure already moved, see: ltp { game.Debug("panic->k testing for " + p.P.Id + " | " + d); game.Debug(p.AVALIBLE + " && " + (p.P.ReloadTurns < mx) + " && " + (d > game.Distance(p.P, tar))); if (p.AVALIBLE && p.P.ReloadTurns < mx && d > game.Distance(p.P, tar)) { d = game.Distance(p.P, tar); k = p.P; game.Debug("panic->k = " + p.P.Id + " | " + d); } } if (k == null) // no Pirate with ammo, so choose the closest to the InitialLocation then move to there { foreach (PirateContainer p in PirateContainer.free) // notice all pirates with Treasure already moved, see: ltp { if (p.AVALIBLE && d > game.Distance(p.P, tar.InitialLocation)) // TODO: make the "6" generic to board size { d = game.Distance(p.P, tar.InitialLocation); k = p.P; } } } } List <int> dss = sortInto(ds); // sort the ds into the dss // AAAAATTTTTTTTTTTTAAAAAAAAAAACCCCCCCCKKKKKKKKKKKKKKK!!!!!!!!!!!!!!!! (or defend...) for (int i = PirateContainer.free.Count; i > 0;) { PirateContainer p = PirateContainer.free[--i]; if (p.P.ReloadTurns == 0 && !p.P.HasTreasure && p.AVALIBLE) { List <Pirate> es = findTargetsFor(p.P, game); if (es.Count > 0) { new QueuedAttack(p, es); } } } QueuedAttack.doAttacks(game, deadMap); // move for (int j = 0; j < ships; j++) { int i = dss[j]; if (ps[i].S == PirateContainer.State.none && ps[i].AVALIBLE && !ps[i].P.HasTreasure) { if (game.Treasures().Count > 0) // use typical motion { int mv = move(ps[i], ts[i].Location, remaining, game); if (mv > 0) { remaining -= mv; continue; } } if (game.EnemyPiratesWithTreasures().Count > 0 && ps[i].P == k) // activate search and destroy { remaining -= move(ps[i], tar.Location, remaining, game); } } } } catch (Exception e) { game.Debug("Crashed!"); game.Debug(e.Message); game.Debug(e.StackTrace); } game.Debug("turn " + game.GetTurn() + ": ran " + (game.GetActionsPerTurn() - remaining) + " motions"); }
// this is the actual turn public void DoTurn(IPirateGame game) { int remaining = game.GetActionsPerTurn(); if (game.GetTurn() == 1) { game.Debug("moves per turn: " + remaining); } try { #region init if (game.GetTurn() == 1) { chooseMap(game); } nowhere = inNowhereMode(game); if (nowhere) { game.Debug("ACTIVATING NOWHERE MODE"); } panic = inPanicMode(game); if (panic) { game.Debug("ACTIVATING PANIC MODE"); } PirateContainer.init(game); QueuedAttack.init(); QueuedMotion.init(); int ships = game.AllMyPirates().Count; PirateContainer[] ps = new PirateContainer[ships]; int[] ds = new int[ships]; Treasure[] ts = new Treasure[ships]; #endregion calcBestTreasure(game, ships, ref ps, ref ds, ref ts); // calculate the closest treasure to ps[i] BringBackTreasure(game, ref remaining); // move Pirates that have treasures towards the base calcKamikazes(ps, ref ts, ref ds, game); // control the kamikazes //BringBackTreasure(game, ref remaining); // move Pirates that have treasures towards the base //Powerup pt = new SpeedPowerup(-1, new Location(0, 0), 0, 0, 0); #region power up calculations Powerup[] pu = (from l in game.Powerups() where l.Type == "Speed" select l).ToArray(); if (pu.Count() > 0) { Powerup[] puu = new Powerup[ships]; for (int i = pu.Count() - 1; i >= 0; i--) { puu[i] = pu[i]; } game.Debug("A speed powerup was found"); int[] dis = new int[ships]; locatePowerups(game, ships, ref ps, ref dis, ref puu); int chosen = -1; for (int i = 0, min = int.MaxValue; i < ships; ++i) { if (dis[i] < min && ps[i].AVALIBLE && dis[i] != 0) //&& !ps[i].P.HasTreasure { min = dis[i]; chosen = i; } } game.Debug("Moving pirate " + chosen + " towards powerup"); if (chosen != -1) { game.Debug("Distance of chosen powerup - " + dis[chosen]); if (puu[chosen] == null) { game.Debug("we found the problem"); } remaining -= move(ps[chosen], puu[chosen].Location, remaining, game); } } #endregion #region panic mode Pirate k = null, tar = null; if (panic) { search_n_destroy(game, ref tar, ref k); // search and destroy, TODO: prioritise this!!! } #endregion List <int> dss = sortInto(ds); // sort the ds into the dss attack(game); QueuedAttack.doAttacks(game, deadMap); #region move // move for (int j = 0; j < ships; j++) { int i = dss[j]; if (ps[i].S == PirateContainer.State.none && ps[i].AVALIBLE && !ps[i].P.HasTreasure) { if (game.Treasures().Count > 0) // use typical motion { Location l = powerup(ps[i].P.Location, ts[i].Location, game); int mv; if (l != null) { mv = move(ps[i], l, remaining, game); } else { mv = move(ps[i], ts[i].Location, remaining, game); } if (mv > 0) { remaining -= mv; continue; } } if (game.EnemyPiratesWithTreasures().Count > 0 && ps[i].P == k) // activate search and destroy { remaining -= move(ps[i], tar.Location, remaining, game); } } } #endregion } catch (Exception e) { game.Debug("Crashed!"); game.Debug(e.Message); game.Debug(e.StackTrace); } finally { WastedTurnsCounter += remaining; game.Debug("________"); game.Debug("turn " + game.GetTurn() + " - moves summary"); game.Debug("turns used: " + (game.GetActionsPerTurn() - remaining)); game.Debug("turns wasted: " + remaining); game.Debug("________"); game.Debug("game summary"); game.Debug("turns used: " + (game.GetTurn() * game.GetActionsPerTurn() - WastedTurnsCounter) + "/" + (game.GetTurn() * game.GetActionsPerTurn()) + ", " + Math.Round((100 - (float)WastedTurnsCounter * 100 / (float)(game.GetTurn() * game.GetActionsPerTurn())), 2) + "% efficiency"); game.Debug("turns wasted: " + WastedTurnsCounter); } }