Hi !
Featured games (85)
games approved by the League of Dukes
Games in Showcase (636)
Games in Android Showcase (178)
games submitted by our members
Games in WIP (687)
games currently in development
News: Read the Java Gaming Resources, or peek at the official Java tutorials
    Home     Help   Search   Login   Register   
Pages: [1]
  ignore  |  Print  
  Pathfinding algorithms?  (Read 4196 times)
0 Members and 1 Guest are viewing this topic.
Offline appel

JGO Wizard

Medals: 73
Projects: 4

I always win!

« Posted 2007-01-30 21:21:46 »

I'm wondering what pathfinding algorithms exist out there. I know of A*, Djikstra, DFS, BFS... any others that are used for pathfinding? I'm doing a study project on this, would appreciate tips Smiley

Check out the 4K competition @
Check out GAMADU (my own site) @
Offline PeterB

Junior Devvie

Exp: 15 years

« Reply #1 - Posted 2007-01-30 22:20:10 »

There a note of some Shortest Path Algorithms here:

Offline ravenger

Senior Newbie

« Reply #2 - Posted 2007-02-01 11:01:09 »

hillclimbing algorithm is another. Note that there are some nice A* variations aswell, one of which is space-time A*, which adds a 3rd dimension to your 2d searchgrid, which helps you solve paths when you are dealing with moving obstacles (it is described in the AI Game Programming Wisdom 3 book Wink)
Games published by our own members! Check 'em out!
Legends of Yore - The Casual Retro Roguelike
Offline darkprophet

Senior Devvie

Go Go Gadget Arms

« Reply #3 - Posted 2007-02-01 16:25:45 »

Ive heard alot about this space-time A* algorithm, but never seen a tutorial or even an implementation of which. I would be really interested in that algorithm


Friends don't let friends make MMORPGs.

Blog | Volatile-Engine
Offline appel

JGO Wizard

Medals: 73
Projects: 4

I always win!

« Reply #4 - Posted 2007-02-02 01:33:02 »

Does anyone have a link explaining D* ?

Check out the 4K competition @
Check out GAMADU (my own site) @
Offline JAW

Senior Devvie

Medals: 2

« Reply #5 - Posted 2007-04-25 15:09:42 »

As far as I know D* is dynamical A*, which takes dynamic / moving obstacles into account. But I might be wrong there.

There are other, suboptimal algorithms, which only perform well when some requirements are met. One I know is:

- Create the path as direct line between start and destination.
- Go to the middle of the path and see if this point is on an obstacle. If yes, try to move it until it is no longer on an obstacle.
If no, just continue:
- Now consider the first and the second half of the path and again find a point in the middle. Again see if these points are
on an obstacles and move them if they are.
Continue to half subpaths until you cannot split them any more. Always move any point which is on an obstacle.

Hmm, hard to describe, I hope you get it. This only works with limited obstacles which are convex.

A second question of pathfinding is where and how to place the nodes. Many games can provide better graphs
than a grid of tiles. Pathfinding costs can be greatly reduced by optimising the search space.

Pages: [1]
  ignore  |  Print  
You cannot reply to this message, because it is very, very old.

Dwinin (72 views)
2015-11-07 13:29:08

Rems19 (81 views)
2015-10-31 01:36:56

Rems19 (74 views)
2015-10-31 01:32:37

williamwoles (107 views)
2015-10-23 10:42:59

williamwoles (93 views)
2015-10-23 10:42:45

Jervac_ (107 views)
2015-10-18 23:29:12

DarkCart (135 views)
2015-10-16 00:58:11

KaiHH (116 views)
2015-10-11 14:10:14

KaiHH (156 views)
2015-10-11 13:26:18

BurntPizza (171 views)
2015-10-08 03:11:46
Rendering resources
by Roquen
2015-11-13 14:37:59

Rendering resources
by Roquen
2015-11-13 14:36:58

Math: Resources
by Roquen
2015-10-22 07:46:10

Networking Resources
by Roquen
2015-10-16 07:12:30

Rendering resources
by Roquen
2015-10-15 07:40:48

Math: Inequality properties
by Roquen
2015-10-01 13:30:46

Math: Inequality properties
by Roquen
2015-09-30 16:06:05

HotSpot Options
by Roquen
2015-08-29 11:33:11 is not responsible for the content posted by its members, including references to external websites, and other references that may or may not have a relation with our primarily gaming and game production oriented community. inquiries and complaints can be sent via email to the info‑account of the company managing the website of java‑
Powered by MySQL Powered by PHP Powered by SMF 1.1.18 | SMF © 2013, Simple Machines | Managed by Enhanced Four Valid XHTML 1.0! Valid CSS!