Jump to content

Sky Slate Blueberry Blackcurrant Watermelon Strawberry Orange Banana Apple Emerald Chocolate

AHK Programming Arena suggestions, questions and bug reports

  • Please log in to reply
91 replies to this topic
  • Members
  • 1578 posts
  • Last active: Nov 27 2013 06:46 PM
  • Joined: 24 Dec 2008

we aren't dealing with walls and obstacles (or a maze)

A* being used on 15+ units on a 25x25 map every turn would significantly affect processing time and slow the code down

Random question:

If their were a set path, that went across the map, or in a path/pattern across the map, would all 625 squares of the 25x25 map need scanning? Or only the set path?

If the path is randomized I imagine this would be difficult, but if you can define a path in the code somehow, wouldn't you only need to scan the 50-125 squares on the path/pattern themselves?

  • Moderators
  • 4323 posts
  • Last active: Jan 28 2016 01:38 AM
  • Joined: 08 Apr 2009
Processing the entire map is not really necessary. The usage would probably be to set a destination, form a rectangle (with a margin of 1 tile) and process all rectangle's positions. Just an idea.


Antonio Fran├ža -- git.io -- github.com -- ahk4.net -- sites.google.com -- ahkscript.org

Member of the AHK community since 08/Apr/2009. Moderator since mid-2012.