Implement pathfinding for monsters, using the A* algorithm.

It's not actually used anywhere yet, but I've implemented a wizmode
testing function (x on monster, then 'w') that calculates the shortest
path to any playerchosen destination on the level, and it seems to work 
quite well. The monsters tend to take zigzag paths but that should be 
easy enough to smooth out and in any case doesn't matter all that much 
since the player usually won't witness this. Oh, and though I tested 
the whole thing in a labyrinth, it went ridiculously fast! I'd rather
doubted that but Darshan was completely right, as usually. :p

Please don't remove the debugging output yet, I still need them.


git-svn-id: https://crawl-ref.svn.sourceforge.net/svnroot/crawl-ref/trunk@5476 c06c8d41-db1a-0410-9941-cceddc491573

1 files changed, 3 insertions, 2 deletions

diff --git a/crawl-ref/source/command.cc b/crawl-ref/source/command.cc
index 5f4b35fef0..eb04dafcd5 100644
--- a/crawl-ref/source/command.cc
+++ b/crawl-ref/source/command.cc
@@ -305,10 +305,10 @@ static void _adjust_spells(void)
         return;
     }
 
-    // print out targeted spell:
+    // Print targeted spell.
     mprf( "%c - %s", keyin, spell_title( spell ) );
 
-    // Select target slot
+    // Select target slot.
     keyin = 0;
     while ( !isalpha(keyin) )
     {
@@ -662,6 +662,7 @@ static const char *targeting_help_1 =
     "<w>F</w>: cycle monster friendly/good neutral/neutral/hostile\n"
     "<w>P</w>: apply divine blessing to monster\n"
     "<w>m</w>: move monster or player\n"
+    "<w>w</w>: calculate shortest path to any point on the map\n"
 #endif
 ;