aeife/astar3d

A three-dimensional a-star algorithm.

astar3d's Issues

first implementation

first easy implementation of the a-star algorithm

measure runtime

Measure runtime with different input-data, random and specific.

file based level export and import

Implement file based level export and import using the exisitng json format.

first runtime measurements

Measure runtime of algorithm.

Growing plain 2d-field, pathfinding between oposite corners. Measure runtime in relation to traversed nodes.

Also measure asymptotic runtime, e.g. N².

algorithm adjustments

How can the algorithm be adjusted for the data? Plan and justify.

Maybe some first results if the adjustments work.

input data: application specific

implement data typical for the application

e.g. a custom designed three-dimensional level

input data: "normal"

implement "normal" (random?) input data

extendable field

Extendable field had to be removed because of many bugs considering negative indexes and false length information. Maybe there is another solution?

rearrange graph class

Rearrange the graph class to match common oo specifications. Replace init function with constructor.

add animation mode

Implementing optional animation mode. Nodes should be marked according to their current status during the algorithm.

Also maybe add adjustable animation speed.

binary heap

Implement binary heap for searching node with lowest f-score.

Binary heap sorts nodes by a value, e.g. the f-score. So the node with the lowest f-score is always the root. This is a possibility for runtime improvement.