1 /***************************************************************************
2 planet.cpp - description
5 copyright : (C) 2002 by Michael Andreen
7 ***************************************************************************/
9 /***************************************************************************
11 * This program is free software; you can redistribute it and/or modify *
12 * it under the terms of the GNU General Public License as published by *
13 * the Free Software Foundation; either version 2 of the License, or *
14 * (at your option) any later version. *
16 ***************************************************************************/
31 //////////////////////////////////////////////////////////////////////////
33 unsigned Planet::planetScore(int tick = 0) const
35 int ticks = m_Score.size();
42 return m_Score[ticks];
47 //////////////////////////////////////////////////////////////////////////
49 void Planet::setPlanetScore(unsigned number, int tick = 0)
52 int ticks = m_Score.size();
55 earlier = m_Score[ticks - 1];
57 for (int i = ticks; i <= tick; ++i)
59 m_Score.push_back(earlier);
61 m_Score[tick] = number;
64 //////////////////////////////////////////////////////////////////////////
66 void Planet::addPlanetScore(unsigned number, int tick = 0)
69 int ticks = m_Score.size();
72 earlier = m_Score[ticks - 1];
74 for (int i = ticks; i <= tick; ++i)
76 m_Score.push_back(earlier);
78 m_Score[tick] += number;
80 //////////////////////////////////////////////////////////////////////////
82 int Planet::roids(std::string type, int tick = 0) const
84 // const... I would like [] as for const types: int ticks = m_Roids[type].size();
86 vector<int>const* roids = 0;
87 for (RoidList::const_iterator i = m_Roids.begin(); i != m_Roids.end(); ++i)
98 int ticks = roids->size();
104 return roids->at(ticks);
105 return roids->at(tick);
108 //////////////////////////////////////////////////////////////////////////
110 void Planet::setRoids(std::string type, int number, int tick = 0)
112 int ticks = m_Roids[type].size();
114 if (m_Roids[type].size() > 0)
115 roids = m_Roids[type][m_Roids[type].size() - 1];
117 for (int i = ticks; i <= tick; ++i )
118 m_Roids[type].push_back(roids);
119 m_Roids[type][tick] = number;
122 //////////////////////////////////////////////////////////////////////////
124 void Planet::takeRoids(std::string type, int number, int tick = 0)
126 int ticks = m_Roids[type].size();
128 if (m_Roids[type].size() > 0)
129 roids = m_Roids[type][m_Roids[type].size() - 1];
131 for (int i = ticks; i <= tick; ++i )
132 m_Roids[type].push_back(roids);
133 m_Roids[type][tick] -= number;
138 //////////////////////////////////////////////////////////////////////////
140 void Planet::runBattle(std::vector<Fleet*> friendly, std::vector<Fleet*> hostile)
142 if (hostile.size() == 0)
146 for(int tick = 1; skipped < 20; ++tick)
148 //See who's in the battle at the current tick
149 vector<Fleet*> friends = calculateSide(friendly, 6, tick);
150 vector<Fleet*> hostiles = calculateSide(hostile, 3, tick);
152 // No idea to calculate anything if noone is there.. ;)
153 if (hostiles.size() == 0)
162 allFriends.addToThis(friends, tick - 1);
164 /*for (RoidList::iterator i = m_Roids.begin(); i != m_Roids.end(); ++i)
165 allFriends.setRoids(i->first, roids(i->first, tick));
167 allFriends.setPlanetScore(m_iScore);*/
170 allHostiles.addToThis(hostiles, tick - 1);
172 map<string, map<string, int> > stealfriendly;
173 map<string, map<string, int> > stealhostile;
176 for (RoidList::iterator roid = m_Roids.begin(); roid != m_Roids.end(); ++roid)
177 setRoids(roid->first, roids(roid->first, tick-1), tick);
180 calcOneTick(&allFriends, &allHostiles, stealfriendly, stealhostile, tick );
182 //allFriends.printFleet();
184 allFriends.distributeLossesGains(friends, tick);
185 allHostiles.distributeLossesGains(hostiles, tick);
186 allHostiles.distributeCappedRoids(hostiles, tick);
188 calculateScoreLoss(friends, tick);
190 /* for (RoidList::iterator i = m_Roids.begin(); i != m_Roids.end(); ++i)
191 setRoids(i->first, roids(i->first, 1), tick);*/
194 for (RoidList::iterator i = m_Roids.begin(); i != m_Roids.end(); ++i)
196 for (vector<int>::iterator j = i->second.begin(); j != i->second.end(); ++j)
197 cout << i->first << " roids : " << (*j) << endl;
201 //////////////////////////////////////////////////////////////////////////
203 void Planet::calcOneTick(Planet* friendly, Fleet* hostile, std::map<std::string, std::map<std::string, int> >& stealfriendly, std::map<std::string, std::map<std::string, int> >& stealhostile, int tick = 0)
205 map<int, string> unitsinit; // order units after their ininitiative
206 for (UnitList::iterator i = s_Units.begin(); i != s_Units.end(); ++i)
207 unitsinit[i->second.initiative()] = i->first;
209 for (map<int, string>::iterator i = unitsinit.begin(); i != unitsinit.end(); ++i)
211 Fleet* hostiletemp = new Fleet(*hostile);
212 Planet* friendlytemp = new Planet(*friendly);
214 string unittype = i->second;
216 //cerr << "Initiative: " << s_Units[unittype].initiative() << " with unit: " << unittype << endl;
218 if (s_Units[unittype].type() == "EMP")
220 hostiletemp->takeEMP(unittype, friendly->freeFleet(unittype, 1));
221 friendlytemp->takeEMP(unittype, hostile->freeFleet(unittype, 1));
223 else if (s_Units[unittype].type() == "Steal")
225 hostiletemp->takeShoot(unittype, friendly->freeFleet(unittype, 1), stealfriendly[unittype]);
226 friendlytemp->takeShoot(unittype, hostile->freeFleet(unittype, 1), stealhostile[unittype]);
230 map<string, int> temp;
231 hostiletemp->takeShoot(unittype, friendly->freeFleet(unittype, 1), temp);
232 friendlytemp->takeShoot(unittype, hostile->freeFleet(unittype, 1), temp);
235 if (s_Units[unittype].type() == "Pod")
237 if (planetScore(tick - 1) > 0)
239 setCapping(float(planetScore(tick - 1)) / hostile->score() / 10, tick);
241 cerr << "Capping is: " << capping(tick) << endl;
243 if (capping(tick) > 0)
245 for (RoidList::iterator roid = m_Roids.begin(); roid != m_Roids.end(); ++roid)
247 int caproids = capping(tick) * roids(roid->first, tick - 1);
248 int freepods = hostiletemp->freeFleet(unittype, 1);
250 cerr << "Possible to steal " << caproids << " " << roid->first << " roids\n";
251 cerr << freepods << " free pods available\n";
255 if (freepods < caproids)
258 cerr << caproids << " roids stolen\n";
260 takeRoids(roid->first, caproids, tick);
262 //FIXME: Going to move this to the distribute roids section instead.. Not really move, I'll keep this, but "regenerate" the pods in the distribute ships function.
263 hostiletemp->killFleet(unittype, caproids, 1);
264 //int totroids = caproids + hostiletemp->resource(roid->first, 0);
265 hostiletemp->addResource(roid->first, caproids, 1);
267 cerr << caproids << " stolen " << roid->first << " roids\n";
273 //set the the objects so they point at the modified objects
274 *friendly = *friendlytemp;
276 *hostile = *hostiletemp;
281 void Planet::calculateScoreLoss(std::vector<Fleet*> friendly, int tick = 1)
283 for (vector<Fleet*>::iterator i = friendly.begin(); i != friendly.end(); ++i)
285 if ((*i)->name().find("Home") != string::npos)
287 int scorechange = (*i)->score(tick) - (*i)->score(tick - 1);
288 addPlanetScore(scorechange, tick);
293 //////////////////////////////////////////////////////////////////////////
295 float Planet::capping(int tick = 0)
297 int ticks = m_Capping.size();
304 return m_Capping[tick];
307 //////////////////////////////////////////////////////////////////////////
309 void Planet::setCapping(float capping, int tick = 0)
311 int ticks = m_Capping.size();
313 for (int i = ticks; i <= tick; ++i)
315 m_Capping.push_back(0);
318 if (capping <= 0.15 && capping >= 0)
319 m_Capping[tick] = capping;
321 m_Capping[tick] = 0.15;