915,739 views
Welcome to the Programmed Universe! My name is Victor Dias and in this video we will see how to use an algorithm called Monte Carlo Tree Search (in English ''Pure Monte Carlo Tree Search'' or ''Monte Carlo Simulations'') to beat the snake game (SNAKE). Throughout the video we will perform a series of optimizations to improve the algorithm's performance, aiming to achieve the goal of beating the game in the least amount of moves possible. Timelapse of the full game: • Monte Carlo algorithm beating SNAKE ???? - Some other interesting videos on this subject: Monte Carlo Simulation: • Monte Carlo Simulation The history of Artificial Intelligence - TecMundo: • The history of Artificial Intelligence... Discovery Brasil Artificial Intelligence - IBM - • Discovery Brasil Artificial Intelligence... ???? - Other videos from the channel that might interest you: Artificial Intelligence playing the snake game (SNAKE): • Neural Network learning to play the game... Artificial Intelligence CLONE your voice in just 5 seconds: • Artificial Intelligence CLONE your voice... Artificial Intelligence COMPLETING the hardest game in the world!: • Artificial Intelligence COMPLETING the game... ???? - Channel Social Networks: Instagram: / universoprogramado Discord: / discord ????- My Social Networks: LinkedIn: / victor-dias-41109117a ❤️- A big hug and great study for you! #artificialintelligence #snake #programming #computerscience #snakegame