programming-talkscurated list on GitHubRecommends
Under “Clojure”
Playing Go with Clojure 00:35:53 by **Zach Tellman** (2013)
0:00 / 0:00
#clojure#montecarlotreesearch#gogame
Playing Go with Clojure - Zach Tellman
ClojureTV
111K subscribers • 159 videos on Hallway
- Recommended by 2 people: 1 in engineering communities and 1 curated list.
- Presented by Zach Tellman
- May be out of date. Uploaded 13 years ago, in an area where tools change fast.
Intermediate. Assumes working knowledge.
24K views13 years ago2 recommendations
AI and machine learningProgramming languagesLisp and ClojureAlgorithmsGame programming
Zach Tellman discusses the challenges of building a Go AI and implements Monte Carlo tree search in Clojure.
Despite the simplicity of its rules, Go remains something of an open problem for the game AI community. This talk will discuss the inherent difficulties of the problem, provide a survey of current approaches, and explore how they can be efficiently implemented in Clojure.Why it's here
2 people recommend thisWhat people say. Recommended for its salient discussion of trade-offs in game tree searches and Monte Carlo simulations.
u/gracenotesin r/haskell • Recommends
On “How is traditional pathfinding done in Haskell?”
Just tangentially related: there is this great talk, Playing Go with Closure, which is about doing game tree searches in Clojure, not for comprehensive search or even minimax, but to do Monte Carlo simulations. Ultimately, it doesn't have quite as much to do with Haskell, but I find the set of tradeoffs mentioned fairly salient.
As nice as the Java code you've linked is, though, what's the point of running it on only one core? The Clojure talk mentions Java Concurrency in Practice, which has an example of a ConcurrentPuzzleSolver operating on abstract Puzzles. In Haskell, there are quite a few ways to parallelize things, of which Parallel and Concurrent Programming in Haskell has many. (R…