Using Depth First Search Algorithm to Complete the Minimax Tree
You are given a binary tree root representing a game state of a two person game. Every internal node is filled with an empty value of 0 while the …
Category: games
Just Another Sudoku Solver in Depth First Search (and BackTracking) Algorithm
Sudoku is a puzzle where you’re given a partially-filled 9 by 9 grid with digits. The objective is to fill the grid with the constraint that every row, column, …
Microbit Programming: Snake Game with Growing Body and Greedy Strategy
Last week, we show the possibility of playing a simple Snake Game on the Microbit (Microbit Programming: The Development of a Snake Eating Apple Game and AI (Version 1 …
How to Make a Simple Snake Game in Javascript?
Snake Game (snake eats apple and grows) is a simple and easy to implement game that you can practice when you learn a new programming language. It is not …
Microbit Programming: The Development of a Snake Eating Apple Game and AI (Version 1 – Snake Does Not Grow)
December 15, 2019
algorithms, Artificial Intelligence, games, greedy algorithm, javascript, microbit
No Comments
Last week, we bring the intelligence to Microbit (Microbit Programming: Introduction to AI – Letting Computer Play the Game), letting it play the apple-catching game. This week, we’ll design …