Hi there, I am working on a random walker through points, and I am struggling to get the next closest point in the walker class. The idea is to have one or few random walkers going from point to point until there is no point left. void update(ArrayList<Anchor> anchors) { if (anchors.size()>0)…

here is a version that stops. We return -1 (not an allowed index!) to indicate failure when dist > 86 or so Then we evaluate idx and abort update in Walker class ArrayList<Walker> walkers; ArrayList<Anchor> anchors; PVector pos; int walkerCount = 1; int anchorCount = 500; float x = 0; float y …

Random walker through points

Processing Coding Questions

Chrisir February 23, 2020, 11:47am 2

that’s wrong; I think you want i < anchors.size() (think do this as long as)

Chrisir

1 Like

Topic		Replies	Views
Remove Trail, can't figure out how (bot follows a random walker) Coding Questions	6	463	November 24, 2020
How can I create a walker with a finite trail? Coding Questions	12	379	May 2, 2023
Objects moving at the same time Coding Questions	2	323	July 16, 2020
Vector field to an array (Aborigines Art) Coding Questions	14	907	March 2, 2021
A pathfinding solution Processing	27	1180	September 6, 2018

Random walker through points

Related topics