1 public Point FindPath (Point start, Point end, bool IsIgnoreCorner)
 2     {
 3         OpenList.Add (start);
 4         while (OpenList.Count != 0) {
 5             //找出F值最小的点
 6             var tempStart = OpenList.MinPoint ();
 7             OpenList.RemoveAt (0);
 8             CloseList.Add (tempStart);
 9             //找出它相邻的点
10             var surroundPoints = SurrroundPoints (tempStart, IsIgnoreCorner);
11             foreach (Point point in surroundPoints) {
12                 if (OpenList.Exists (point))
13                         //计算G值, 如果比原来的大, 就什么都不做, 否则设置它的父节点为当前点,并更新G和F
14                     FoundPoint (tempStart, point);
15                 else
16                         //如果它们不在开始列表里, 就加入, 并设置父节点,并计算GHF
17                     NotFoundPoint (tempStart, end, point);
18             }
19             if (OpenList.Get (end) != null)
20                 return OpenList.Get (end);
21         }
22         return OpenList.Get (end);
23     }

 1 public bool CanReach (Point start, int x, int y, bool IsIgnoreCorner)
 2     {
 3         if (!CanReach (x, y) || CloseList.Exists (x, y))
 4             return false;
 5         else {
 6             if (Math.Abs (x - start.X) + Math.Abs (y - start.Y) == 1)
 7                 return true;
 8                 //如果是斜方向移动, 判断是否 "拌脚"
 9                 else {
10                 if (IsIgnoreCorner) {
11                     if (CanReach (Math.Abs (x - 1), y) && CanReach (x, Math.Abs (y - 1)))
12                         return true;
13                     else
14                         return false;
15                 } else
16                     return false;
17             }
18         }
19     }