4 ms·
Build a tree, cut the tree at the first link, now you get rid of all of them. Will have some collateral damage though, but maybe safe to assume actually "good p
by embedding-shape 10mo ago
Build a tree, cut the tree at the first link, now you get rid of all of them. Will have some collateral damage though, but maybe safe to assume actually "good players" can rejoin at another maybe more stable leaf
- jacquesm 10mo agoIt's a web, not a tree... so this is really not that simple.
- embedding-shape 10mo agoYeah, that's the problem, and my suggestion is to change it from a web to a tree instead, to solve that issue.
- theshrike79 10mo agoWhat is a web if not multiple trees that have interconnected branches? :)
- embedding-shape 10mo agoIn the end, it's all lists anyways :)
- foobar10000 10mo agoWell - lists of tuples. Otherwise knows as a graph :)
- jacquesm 10mo agoThat does not work because you won't have multiple parties vouching for a new entrant. That's the whole reason a web was chosen instead of a tree in the first place. Trees are super fragile in comparison, bad actors would have a much bigger chance of going undetected in a tree like arrangement.