Game Development Meta
to customize your list.
more stack exchange communities
Start here for a quick overview of the site
Detailed answers to any questions you might have
Discuss the workings and policies of this site
In what instances would you want to use path-finding algorithms other than A*?
I am familiar with how the common ones technically work (BFS, DFS, Dijkstra, A*) but as far as their realistic benefits I don't quite see the need for them. Considering that, given the right ...
Jul 15 '10 at 0:21
newest graphs path-finding questions feed
Hot Network Questions
Windows Services tracker
A paradox to Lenz's law
Protecting Servers from Dust
First missing positive
Nontrivial upper bounds on proof-theoretic ordinals of strong theories: do we have any?
Prime number generator exercise
Dark spot under cockpit on A-10s
Real English, Cleaning Meaning Sexual Intercourse
Why does the Stack Overflow swag request form have six address lines?
Logic to test for 3 of 4
What is exponentiation?
How does binary addition work?
Why "ls" doesnt show the file that "find" discovered ?
Should professors intervene if a student is wearing offensive clothing in their classroom?
Shortest code to print ':)' random times
Is there a practical point in learning foreign words while travelling?
Good slide design for teaching?
Mandelbrot image in every language
Reuse mystery goo transmit in career mode and multiple science for same canister
What does “sign the final flourish” mean?
Why do we use so complicated notation?
What to do if assignment is against student's religion?
How can I kill puppies without consequences?
more hot questions
Life / Arts
Culture / Recreation
TeX - LaTeX
Unix & Linux
Ask Different (Apple)
Geographic Information Systems
Science Fiction & Fantasy
Seasoned Advice (cooking)
Personal Finance & Money
English Language & Usage
Mi Yodeya (Judaism)
Cross Validated (stats)
Theoretical Computer Science
Meta Stack Overflow
Stack Overflow Careers
site design / logo © 2014 stack exchange inc; user contributions licensed under
cc by-sa 3.0