Sorry your browser is not supported!

here is th latest version of my path finding. I finly found out it is based on maze / lee's algorythm. I have made some test maps also made a example ian's a* path finder.

here is some informaton about the code.

V 1 28 by 28 size map
V 2 98 by 98 size map
V 3 grid search increase by 1 ever loop
v 4 gride seearch increase x and y
v 5 useing lists only check new positions

test maps
map 1 blank level start and target are in the couner
map 2 large I
map 3 very large distance between start and target
map 4 rts style map
map 5 start and target are block by a wall small
map 6 rnd walls are used

Times to cal the path . 8 way movement Restrict
V2 V3 v4 v5
map 1 17.7 8.1 8.1 4.0
map 2 29.9 23.3 23.0 3.9
map 3 770.0 769.9 761.4 2.1
map 4 34.4 24.9 24.4 3.7
map 5 12.0 7.0 6.8 4.0
map 6 19.8 10.9 10.6 3.7
times are in ms


Times to cal the path . 4 way movement
V2 V3 v4 v5
map 1 29.7 22.1 22.3 2.3
map 2 33.8 29.0 29.1 2.3
map 3 731.7 767.8 777.5 1.7
map 4 40.7 34.3 34.0 2.1
map 5 15.9 12.1 12.1 2.3
map 6 29.6 22.1 22.1 2.1
times are in ms

ian's Astar pathfinder
8way 8way Restrict 4way flood8 flood8 Restrict
map 1 1.2 1.2 0.9 0.009 0.009
map 2 16.8 17.5 10.0 0.019 0.019
map 3 8.8 9.4 7.1 0.58 0.600
map 4 null 30.9 19.6 null 0.019
map 5 0.6 0.6 0.5 0.009 0.009
map 6 1.1 1.1 6.4 0.009 0.009
times are in ms