In this challenge, I use my JavaScript neural network library and a genetic algorithm to train an agent to play Flappy Bird.
Challenges
Featured Challenge:
#51 — A* Pathfinding Algorithm
In this multi-part coding challenge, I attempt an implementation of the A* Pathfinding Algorithm to find the optimal path between two points in a 2D grid.
Filter by Language
Pick a language to filter
Filter by Topic
genetic algorithms
In this multi-part coding challenge, I create a system where autonomous steering agents evolve the behavior of eating food and avoiding poison.
In Part 1 of this multi-part coding challenge, I introduce the classic computer science problem of the Traveling Salesperson (TSP) and discuss the pitfalls with a brute force solution. In Part 2, I discuss Lexicographic Ordering and demonstrate one algorithm to iterate over all the permutations of an array. In Part 3, I apply this algorithm to a brute-force solution of the TSP problem. Every single route permutation is checked one by one. In Part 4, I attempt to create a solution to the TSP problem with a genetic algorithm, and then I add a “crossover” algorithm in Part 5.
In this coding challenge, I implement a "smart rockets" algorithm (based on a simulation by Jer Thorp).
