@shmerkle69 this was ages ago, I don't have the code anymore.
Basically the maze is broken up into a grid of numbered cells (1 through 12), and the first robot calculates which branches of numbers are dead ends and sends an array of the correct numbered cells to the second robot to traverse. I'm sure you can find algorithms for efficient maze traversal and then intrigate them with how to move the machines.
Cool, I get it now, the first one was mapping the maze, and it sent a signal to the 2nd and the second one following it's 'instructions' through the maze. Impressive!
HI , Is this program posted somewhere, if not, can you help me reproduce this program in lego nxt-g programming?
thanks a bunch.
shmerkle69 11 months ago
@shmerkle69 this was ages ago, I don't have the code anymore.
Basically the maze is broken up into a grid of numbered cells (1 through 12), and the first robot calculates which branches of numbers are dead ends and sends an array of the correct numbered cells to the second robot to traverse. I'm sure you can find algorithms for efficient maze traversal and then intrigate them with how to move the machines.
Hope it helps
AgentMidnight 11 months ago
Woops, I didn't notice it said on the description box. Sorry. O.O
iVietBoiChris 2 years ago
Cool, I get it now, the first one was mapping the maze, and it sent a signal to the 2nd and the second one following it's 'instructions' through the maze. Impressive!
iVietBoiChris 2 years ago