Looks like "braid", "clear", "branching", or "winding" https://github.com/moses-palmer/labyru/blob/master/maze/src/...
weiwenhao: The example in https://nature-lang.org/docs/the-basics/function#multiple-re... has `balance` and `product` swapped.
Ease Waze
The "worst-case number of guesses" objective considered here is pretty insensitive to differences in quality of the decision tree. It seems to me that a better objective would be: minimize the number of secret words…
If you then diagonalize that connection matrix, you can get constant time (though you might have to make a special case for starting at the `5` key): "Diagonalization can be used to efficiently compute the powers of a…
Instant-runoff is a terrible voting system and should never be used, see http://zesty.ca/voting/sim/ . Approval voting is simpler and better. Condorcet is best except that it is somewhat complicated.
Looks like "braid", "clear", "branching", or "winding" https://github.com/moses-palmer/labyru/blob/master/maze/src/...
weiwenhao: The example in https://nature-lang.org/docs/the-basics/function#multiple-re... has `balance` and `product` swapped.
Ease Waze
The "worst-case number of guesses" objective considered here is pretty insensitive to differences in quality of the decision tree. It seems to me that a better objective would be: minimize the number of secret words…
If you then diagonalize that connection matrix, you can get constant time (though you might have to make a special case for starting at the `5` key): "Diagonalization can be used to efficiently compute the powers of a…
Instant-runoff is a terrible voting system and should never be used, see http://zesty.ca/voting/sim/ . Approval voting is simpler and better. Condorcet is best except that it is somewhat complicated.