Closed GoogleCodeExporter closed 9 years ago
Won't implement - simply because "closest" can only be measured by computing a
path, and doing so means running A* for each dwarf for each job EVERY time they
ask for a job. Sure, we could just do street-distance, but we know this is
fundamentally flawed and dangerous. For now we just sort based on attempts: the
most attempted (and thus most resigned) gets put on the bottem of the list,
while least-attempted (i.e. freshest) get returned first.
Original comment by nin...@gmail.com
on 24 Apr 2012 at 6:13
*Forgot to flag as Wont Fix
Original comment by nin...@gmail.com
on 24 Apr 2012 at 6:13
Original issue reported on code.google.com by
nin...@gmail.com
on 14 Mar 2012 at 11:45