# HG changeset patch
# User Neil Muller <drnlmuller@gmail.com>
# Date 1251757227 0
# Node ID 00cf9d7f22dca8835b252cf59d65f4652b64c18a
# Parent  d92a2f973cc49b7e0408a4e525f19dbb1a873498
Expand comment

diff -r d92a2f973cc4 -r 00cf9d7f22dc gamelib/animal.py
--- a/gamelib/animal.py	Mon Aug 31 22:14:41 2009 +0000
+++ b/gamelib/animal.py	Mon Aug 31 22:20:27 2009 +0000
@@ -115,6 +115,9 @@
         min_cost = self._cost_path(direct_path, gameboard)
         min_path = direct_path
         # is there a point nearby that gives us a cheaper direct path?
+        # This is delibrately not finding the optimal path, as I don't
+        # want the foxes to be too intelligent, although the implementation
+        # isn't well optimised yet
         poss = [Position(x, y) for x in range(self.pos.x - 2, self.pos.x + 3)
                 for y in range(self.pos.y - 2, self.pos.y + 3)]
         for start in poss: