NillionNetwork/nada-by-example

Matrix pathfinder / A-star

Open

#8 opened on Aug 13, 2024

View on GitHubContributor guide
 (0 comments) (0 reactions) (0 assignees)Python (10 forks)auto 404
enhancementgood first issuehacktoberfesthelp wanted

Repository metrics

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

Description

Request a New Nada Example: Matrix pathfinder / A-star

Description

Write an A-star pathfinding algorithm to find the shortest path between two secret points in a matrix.

Use Case

Games, maps, location based privacy

Specific Requirements

  • Inputs: grid, point A from Party A, point B from Party B
  • Outputs: distance between point A and point B
  • Document your solution and any helpers created

Contributor guide

Research direction
Understand Nada language basics and data types, then implement A* pathfinding with privacy preserving inputs from two parties.
Tech stack
python
Domain
cryptography
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.
Half day
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Fresh
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
PythonGit
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
65