3 ms·
If I understand this correctly, this basically uses the drawer's perceived number as an out-of-band signalling mechanism for the algorithm they agreed to follow
by niftich 8y ago
If I understand this correctly, this basically uses the drawer's perceived number as an out-of-band signalling mechanism for the algorithm they agreed to follow. Each actor must adhere to the same scheme to address drawers. This means that the drawers must either be uniquely named ("labelled" ahead of time), or have some sort of natural ordering that's algorithmically deterministic (e.g. lexicographic, array index, 2D-position using a previously agreed algorithm like right-then-down).
What are some practical uses for this? Distributed hash table traversal using one's own address [1]?
[1] http://www.bittorrent.org/beps/bep_0005.html http://www.bittorrent.org/beps/bep_0005.html
- blattimwind 8y ago> What are some practical uses for this? Exercise sheets for discrete mathematics courses.
- IneffablePigeon 8y agoThis "look at it as a permutation problem and follow the disjoint cycles" idea is loosely what rainbow tables are based on (although I think in that case because of the possibility of hash collisions they aren't guaranteed to be disjoint cycles, which requires extra work to solve).
- qntty 8y agoDan Luu has a post about how permutation cycles come up in two algorithms https://danluu.com/sattolo/ https://danluu.com/sattolo/