This Repositiry contains the source code which was used for the Microsoft Engage Mentorship Programme 2020. There are two directories which includes an Ai powered Tic-Tac-Toe game and a path finding rover.
As a part of the Microsoft Engage 2020 program we were asked to prepare an AI Powered Tic-Tac-Toe Game using the Minimax Algorithm and to present it with a web interface.The Algorithm has been written in JavaScript and the web interface has been developed using HTMl5,CSS and Javascript.Mongo database has been used as Database service to store the scores of various users who play the game.The Game has two parts: Human vs Ai and Human Vs Human. The first part has several difficulty levels which range from being completely random to being unbeatable. We have also provided the game with a HINT Feature where the user when unable to decide upon a move could refer to for help. In the following follow up we explain the minimax algorithm which powers the game along with the rules of the game and the scoring pattern.The app has been hosted on glitch.
Here is the link for the same https://neontictactoe2020.glitch.me/
The Mars Curiosity Rover finds the shortest path between two points while avoiding obstacles on the way and to present it with a web interface.The Algorithm has been written in JavaScript and the web interface has been developed using HTML5,CSS, Node JS and Javascript.It runs on Node.js and is capable of supporting all the browsers.
At its core, a pathfinding algorithm seeks to find the shortest path between two points.This application visualises various pathfinding algorithms in action. Here, We are using all the algorithms for a 2D grid. Currently, we are using 5 path finding Algorithms.
1.A* -AStar
2.Dijkstra
3.Greedy Best-First Search
4.Breadth-First Search (BFS)
5.Depth-First Search(DFS)
Here is the hosted app link http://mangalyatra.glitch.me/