Jump to content

  • Log In with Google      Sign In   
  • Create Account

#ActualSilgen

Posted 01 December 2012 - 06:43 PM

I've finished implementing what I believe to be an A* algorithm in some rather heinous code. I hope to try out binary heaps when I revisit this.

These are some images showing it in action. Blue representes an obstacle tile, orange a closed list square (explored) and the white line is the final path. Does this look correct? It moves towards the obstacle, then fills in back toward the starting point, until it can get around the obstacle, then resumes.

Posted Image

#2Silgen

Posted 01 December 2012 - 06:43 PM

I've finished implementing what I believe to be an A* algorithm in some rather heinous code. I hope to try out binary heaps when I revisit this.

These are some images showing it in action. Blue representes an obstacle tile, orange a closed list square (explored) and the white line is the final path. Does this look correct? It moves towards the obstacle, then fills in back toward the starting point, until it can get around the obstacle, then resumes.

Posted Image

#1Silgen

Posted 01 December 2012 - 06:43 PM

I've finished implementing what I believe to be an A* algorithm in some rather heinous code. I hope to try out binary heaps when I revisit this.

These are some images showing it in action. Blue representes an obstacle tile, orange a closed list square (explored) and the white line is the final path. Does this look correct? It moves towards the obstacle, then fills in back toward the starting point, until it can get around the obstacle, then resumes.

[img]http://i.imgur.com/UvDhv.jpgimg]

PARTNERS