https://wiki.kram.nz/index.php?action=history&feed=atom&title=SE701%3APathfinding 2026-06-29T09:30:20Z Revision history for this page on the wiki MediaWiki 1.45.3 https://wiki.kram.nz/index.php?title=SE701:Pathfinding&diff=89&oldid=prev 2008-02-15T20:10:34Z

<p>New page: =First Part: Pathfinding using A* algorithm= The basic idea is to find the shortest path from the start point to the target point using A* algorithm. For more details please refer to: ht...</p> <p><b>New page</b></p><div>=First Part: Pathfinding using A* algorithm=<br /> <br /> The basic idea is to find the shortest path from the start point to the target point using A* algorithm.<br /> <br /> For more details please refer to: http://www.gamedev.net/reference/articles/article2003.asp<br /> <br /> <br /> &lt;b&gt;Should Demonstrate:&lt;/b&gt;<br /> <br /> * anonymous functions<br /> * macros<br /> * the FORMAT function<br /> * arbitrary-precision integers<br /> * list processing<br /> * condition restarts<br /> <br /> <br /> =Second Part: Simple draw picture program=<br /> <br /> This program will read a .txt file and draw the shapes described in the file.<br /> <br /> For more details please refer to the question 3 of CS372 Assignment1.<br /> <br /> <br /> &lt;b&gt;Should Demonstrate:&lt;/b&gt;<br /> <br /> <br /> <br /> <br /> [[SE701|Back to SOFTENG701 main page]]</div>

Mark