| 1 | 50 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 1 | 50 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 1 | 50 | 1 | 50 | 1 | 50 | 50 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 1 | 50 | 1 | 50 | 1 | 50 | 50 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 1 | 50 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 1 | 50 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| Examined but not chosen Cost is displayed. |
|
| Open pastures, Cost is displayed. |
|
| Blocking | |
| Found Path, Movement number is displayed. |
|
| Next Best choice, Movement number is displayed. |
|
|
You can view source to save the code. It's not the fastest, nore does it find the shortest path. But it does find a path. Free for any use you can find for it. I can not be held repsponsible for any miss-use of this code. | |