anvaka / anvaka/ngraph.path

Usage in a grid based system

Open
#9 3 comments 0 reactions 0 assignees View on GitHub
Dominant language
JavaScript
Stars
3.1k
Forks
192
PR merge metrics
No merged PRs in 30d

Description

Hi,

I’m developing a simple game on a 2D grid.

I have many enemies that have to find shortest path to the player every 0.5 second.
There’s static and dynamic obstacles in the grid (when an enemy or player moves, the tile it moves onto becomes an obstacle for other enemies).
In other words they can’t stand on the same tile.

I’m trying to use your library to implement this but a little confused as to how to code the obstacles bit.

Can I get some advice please? Do I have to add links to every walkable neighbour tile of each tile?

Contributor guide

No contributing guide indexed for this repository

Research direction

The issue mentions the graph/pathfinder library but names no source files, tests, or entry points. Start by locating the public API and existing usage documentation for obstacles and neighbour links; done means documenting how static and dynamic obstacles are represented for a grid-based game.

Written by the indexing model from the issue text.

Assessment

Tech stack
javascript
Domain
tooling
Issue type
Documentation
Difficulty
4/5
Estimated time
3-5 days
Activity status
Stale
Clarity
Needs clarification
Newbie friendliness
25/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.