Open GoogleCodeExporter opened 9 years ago
just a quick comment so people know i am alive and that someone reads this
every so often: right now, the algorithm is purely greedy. there are various
ways it could be made non-greedy, and the idea you mention would fall into that
general category. since the basic optimization routine already works in the
manner you describe, the only change needed to implement this would be to
sometimes remove the lowest performing building according to some heuristic and
then continue. if the removal was limited to once per N steps you wouldn't need
to worry about cycles too much except at the end: if you wanted to keep ripping
and re-placing the last building then you would of course need to detect a
fixed point.
Original comment by moske...@gmail.com
on 9 Feb 2012 at 4:51
Original issue reported on code.google.com by
Daniel.K...@gmail.com
on 22 Dec 2011 at 12:49