Tag
Ai
- Snake in Go: stretching the longest path Stretching a route to keep the body trailing behind, and why it scores worse than walking straight at the fruit Snake AI in Go: eleven ways to play 6 min
- Snake in Go: A* search instead of BFS A* finds the routes breadth first search finds, having looked at a fraction of the board Snake AI in Go: eleven ways to play 6 min
- Snake in Go: shortest path with breadth-first search Breadth first search, a bordered board, and why searching properly is barely worth six points Snake AI in Go: eleven ways to play 7 min
- Snake in Go: a greedy player The greedy snake: no search, no lookahead, and three and a half times the score Snake AI in Go: eleven ways to play 4 min
- Snake in Go: a random-move baseline The simplest player there is, and the baseline everything else is measured against Snake AI in Go: eleven ways to play 4 min
- Eleven ways to play snake in Go, from random to NEAT A series on writing snake players in GO, from random moves to an evolved neural network Snake AI in Go: eleven ways to play 5 min
- NEAT in Go: the evolution loop and reproducible runs Evaluation, the loop, and making a stochastic algorithm reproducible enough to debug NEAT in Go: neuroevolution from scratch 7 min
- NEAT in Go: deterministic parallel reproduction with goroutines Building the next generation in parallel without making the run depend on which goroutine won NEAT in Go: neuroevolution from scratch 6 min
- NEAT in Go: fitness sharing and culling Fitness sharing, culling, and four places where an obvious-looking division is wrong NEAT in Go: neuroevolution from scratch 8 min
- NEAT in Go: speciation with compatibility distance Measuring how different two genomes are, and why the threshold cannot be a constant NEAT in Go: neuroevolution from scratch 7 min