Zannick/logic-graph

Thru points for exits

Open

#187 opened on Jun 18, 2024

View on GitHub
 (0 comments) (0 reactions) (0 assignees)Rust (0 forks)auto 404
enhancementgood first issuehelp wanted

Repository metrics

Stars
 (4 stars)
PR merge metrics
 (PR metrics pending)

Description

This would mean we don't need to make multiple spots to automatically determine the best movement around an obstacle.

Potentially, this could even allow multiple different movements, but that isn't a requirement (and might be confusing and/or complicated).

Contributor guide

Research direction
Explore the routing logic in the codebase, particularly how exits and paths are currently handled. Propose a design for through points that can be automatically computed to determine optimal movement around obstacles.
Tech stack
rust
Domain
game dev
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-2 days
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Mostly clear
Prerequisites
RustGit
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
60