CmdDot

14 ms·

1. 1.▲
   by CmdDot 9mo ago

   When it comes to quickly reducing the search space of possible words, it is - that’s how you solve it optimally, even if (or in fact, especially) if the word they chose intentionally does not use the most frequent letters. The faster you
2. 2.▲
   by CmdDot 9mo ago

   «As such, you want to pick a pair where the odds are as close to 50/50 as possible.» This is incorrect, the correct strategy is mostly to check the most probable match (the exception being if the people in that match has less possible
3. 3.▲
   by CmdDot 9mo ago

   In addition to Mastermind, Wordle also falls into the same category. Optimal play to reduce the search space in both follow the same general pattern - the next check should satisfy all previous feedback, and included entries should be the m
4. 4.▲
   by CmdDot 3y ago

   From the post: «In the context of resource-constraint embedded devices, it may make sense to tailor an interpreter to a specific applications to gain best performance.» The «key problems» are also discussed in the introduction of the paper
5. 5.▲
   by CmdDot 9y ago

   Funnily enough, I ended up not including a PS starting with "A sufficiently smart JIT, however..." ;)
6. 6.▲
   by CmdDot 9y ago

   Not really, once a program is compiled with -retpoline, new hardware won't bring back reliable branch prediction. I'd hope maybe, just maybe, this would be enough to put a focus on compilers producing code that ends up using proce