(no title)
cuken | 1 year ago
At least for the first example:
You have a blue box labeled xt with a single node connector at the top. You have a purple box labeled ht with a node connector at the top and bottom. You have a green box labeled Yt with a node connector at the bottom.
The game tells you at the top you have 3 edges remaining.
Dragging a line from one node to another, releasing, and it turning green means you have placed a "correct" connection.
i.e. xt -> ht [bottom] will give you a green line.
Repeat until you have all edges solved for.
It's not spelling it out for you, but once you complete the "game" you'll at a very high level understand the moving pieces within the network, and the "flow" of data.
dkersten|1 year ago