Differences

This shows you the differences between two versions of the page.

--- public:t-622-arti-11-1:lab_4_materials [2011/02/01 19:37] – angelo
+++ public:t-622-arti-11-1:lab_4_materials [2024/04/29 13:33] (current) – external edit 127.0.0.1
@@ Line 1: / Line 1: @@
-===== Lab 4: A* Pathfinding Search (WARNING: Work in Progress) =====
+===== Lab 4: A* Pathfinding Search =====
 In this lab we will take a closer look at the A* Search algorithm using some **Testing Tools** and different **Heuristics** for the **Pathfinding** problem.
@@ Line 9: / Line 9: @@
     * [[http://www.gamasutra.com/features/19990212/sm_01.htm|Intelligent Pathfinding Article]] (with a Delphi Example for Win32);
     * More information on [[http://theory.stanford.edu/~amitp/GameProgramming/Heuristics.html| pathfinding A* heuristics]];
+    * Another [[http://www.turtlezero.com/models/view.php?model=a-star_2009|Java Applet]] implementing the A* Pathfinding Search.
 ==== Examining Heuristics for the A* Pathfinding Search ====
@@ Line 39: / Line 40: @@
 h(n) = D2 * h_diagonal(n) + D * (h_straight(n) - 2*h_diagonal(n)))
 </code>
-      * **Diagonal** heuristics, with **Tie-Breaker**: Slight scaling of **f(n)** to avoid repeating the same **f(n)** value;
+      * **Diagonal** heuristics, with **Tie-Breaker**: Slight scaling of **h(n)** to avoid repeating the same **f(n)** value;
       * **Diagonal** heuristics, with **Tie-Breaker**, and **Cross-Product**: Scaling of **f(n)** with the cross-product of the **n->Goal** vector with the **Start->Goal** vector, resulting **f(n)** scaled higher if **n** lies further out from the direct goal line.
   - Imagine that you are developing a computer game with characters that need to traverse a variety of terrains.