[a / b / c / d / e / f / g / gif / h / hr / k / m / o / p / r / s / t / u / v / vg / vm / vmg / vr / vrpg / vst / w / wg] [i / ic] [r9k / s4s / vip] [cm / hm / lgbt / y] [3 / aco / adv / an / bant / biz / cgl / ck / co / diy / fa / fit / gd / hc / his / int / jp / lit / mlp / mu / n / news / out / po / pol / pw / qst / sci / soc / sp / tg / toy / trv / tv / vp / vt / wsg / wsr / x / xs] [Settings] [Search] [Mobile] [Home]
Board
Settings Mobile Home
/sci/ - Science & Math

Name
Options
Comment
Verification
4chan Pass users can bypass this verification. [Learn More] [Login]
File
  • Please read the Rules and FAQ before posting.
  • Additional supported file types are: PDF
  • Use with [math] tags for inline and [eqn] tags for block equations.
  • Right-click equations to view the source.

08/21/20New boards added: /vrpg/, /vmg/, /vst/ and /vm/
05/04/17New trial board added: /bant/ - International/Random
10/04/16New board for 4chan Pass users: /vip/ - Very Important Posts
[Hide] [Show All]


🎉 Happy Birthday 4chan! 🎉


[Advertise on 4chan]


What does /sci think of the A-Star algorithm? Is it truly the best algorithm for finding paths, especially in complex scenarios like video games?
>>
A star is garbage because there are often more optimized modifications you can make taking advantage of precisely what your game needs.
>>
>>16802690
You can't prove A* (or any other) is the best psthfinsing algorithm without solving P?=NP
>>
>>16802690
The best algorithm is no algorithm. You should really read something like Programming Pearls or Backhouse’s Algorithmic Problem Solving.
>>
The real answer is it depends on the application and variables: Number of AI agents, complexity of the navigable environment, pre-calculated navmesh vs. dynamic pathing, limits on resources due to other systems etc.

A* can work fine for a simple FPS with constrained maps but would not be able to handle like an RTS or city builder with thousands of AI agents navigating a complex world.
>>
>>16802690
>>16803034
>The real answer is it depends on the application and variable
This.
For example in uniform-cost grids A-Star has been obsolete since 2011 when Jump Point Search was discovered and there is not much reason one would reach for A-Star in such a scenario (since JPS in its worst case situations just drops back down to A-Star levels).
>>
>>16802690
Why not Dijkstra?
>>
>>16802829
N = 1
>>
>>16807705
A* and Dijkstra are a Variation of the same thing.

There is a new fastes boy in town anyway:
https://arxiv.org/abs/2504.17033
>>
>>16802690
A* suffers from dimensionality problems very quickly. Most practical global path planners in video games are going to have to deal with that problem somehow.

You could do a continuous graphical method like RRT or PRM's and avert a lot of those dimensionality problems in exchange for questionable completeness. You could also do some kind of map decomposition and essentially decide the general section of the action space you need to be in before you actually solve for the path.
>>
>>16802690
Why should zombies be able to perfectly pathfind through an opaque maze that they have no prior knowledge of? I dislike a* not only for its computational cost, but for its simulation not matching the application.



[Advertise on 4chan]

Delete Post: [File Only] Style:
[Disable Mobile View / Use Desktop Site]

[Enable Mobile View / Use Mobile Site]

All trademarks and copyrights on this page are owned by their respective parties. Images uploaded are the responsibility of the Poster. Comments are owned by the Poster.