jordanrl / planck Goto Github PK

[depends on #13]

Add an A* pathfinding algorithm that utilizes the available grid structure.

Questions to consider:

• How fine grained should the algorithm be?
• How should "terrain" effects be implemented?
• Should this be done with an SplPriorityQueue or an SplQueue that uses some custom "find best" algorithms?

Resources to consult:

• RedBlobGames A* Guide
• RedBlobGames Pathfinding Notes
• A* Pathfinding by Eden Waith
• A* in PHP using Priority Queue
• A* in PHP using normal Queue

Add the following instrumentation:

• Travis-CI
  • Config File
  • Hook
• Coveralls.io
  • Config File
  • Hook
• Scrutinizer-CI
  • Config File
  • Hook

Create a GridMath class in a new namespace Samsara\Planck\Operator. The job of this class is to take a complete, arbitrarily nested grid and perform calculations on them, such as the distance between two addresses.

It's possible that this could also integrate with samsara/newton to provide distances in units, although that would create a dependency. That likely depends on JordanRL/Newton#10 and JordanRL/Newton#11 however.

For some applications it would be useful to allow the grid to act as a projection of a higher dimension. For instance, a 2D map of a sphere.

Proposed 2D Sphere Projections:

• Mercator
• Miller cylindrical
• Mollweide

Things to consider:

• Should every position on the grid be accounted for, or should ranges be implemented somehow?
• Should the terrain properties only be valid for a certain level of grid nesting and then cascade? If so, what level of the grid can have terrain properties?
• In regards to nesting, will this be different than other types of properties, or is that unique to terrain properties?

Should include:

• Installation
• Concepts
• Usage
  • Examples
• Extending
• Contributing