HackerTrans
トップ新着トレンドコメント過去質問紹介求人

brianberns

no profile record

投稿

Show HN: Crushing Hearts with Deep CFR

brianberns.github.io
1 ポイント·投稿者 brianberns·4 か月前·0 コメント

Solving the NY Times "Pips" game with F#

github.com
63 ポイント·投稿者 brianberns·9 か月前·15 コメント

コメント

brianberns
·13 日前·議論
I had the same lack, so I walked myself through it from the very start: https://brianberns.github.io/01-SineWaves.html
brianberns
·6 か月前·議論
I read this with pleasure, right up until the bit about the ants. Then I saw the note from myself at the end, which I had totally forgot writing seven years ago. I probably first encountered the article via HN back then as well. Thanks for publishing my thoughts!
brianberns
·9 か月前·議論
Thanks! I'm glad to see I'm not the only one who went down this rabbit hole. :)

I considered parallelizing my solution as well, but the problem is that it only gives a linear speedup, while the problem space increases exponentially. I decided to focus on pruning the search tree instead, and that seemed to work pretty well (after much thinking).
brianberns
·6 年前·議論
As an F# developer with just enough category theory to follow along, I think this is really great.

I find the workaround for existential types in .NET particularly interesting, but it seems so verbose. Is there no way to do it with plain functions in order to avoid all the explicit type signatures?
brianberns
·8 年前·議論
This would reveal your intent to a human reader. I think the author of the article was trying to avoid doing that.