Mageek

8 ms·

1. 61.▲
   by Mageek 8y ago

   Many of the algorithms would be very laborious to implement and explain in a language like C or C++. Julia has the advantage that the actual code looks very much like the pseudocode you mention. In fact, the guideline implementation for the
2. 62.▲
   by Mageek 8y ago

   Julia turns out to be a very nice language for problems like this. Many of the algorithms end up looking very much like the pseudocode from the original paper. We can use unicode as well, which makes a lot of the math (like gradient symbols
3. 63.▲
   by Mageek 8y ago

   Wow! Thank you pjscott. Our approach achieves something similar to what you describe for Robert Sedgewick. Its really interesting to hear how others do it.
4. 64.▲
   How We Wrote a Textbook(tim.hibal.org)

   164 points by Mageek 8y ago|18 comments
5. 65.▲
   by Mageek 9y ago

   kk
6. 66.▲
   by Mageek 9y ago

   Thanks, fixed those
7. 67.▲
   by Mageek 9y ago

   The branching factor for games like Go is too high. Alpha Go Zero uses a stochastic policy to focus its attention on useful branches. This policy is optimized alongside the predicted value for each node.
8. 68.▲
   Alpha Go Zero: How and Why It Works(tim.hibal.org)

   354 points by Mageek 9y ago|109 comments