Year-3 Module taken in NTU that requires a group of team members to implement a robot that can explore and find the fastest path in a maze
-
Updated
May 10, 2019 - Java
Year-3 Module taken in NTU that requires a group of team members to implement a robot that can explore and find the fastest path in a maze
This is an AI that solves state space traversal problems by using the A* algorithm!
Solving the 15puzzle or 8puzzle game with A* & IDS algorithms
Golf game using Q-learning, A* pathfinding and bruteforce with a Runge-Kutta physics solver in Java
Implementation of the path-finding algorithm A* with a visual representation.
Pirates of the Caribbean: Dead Man's Chest Solver A repository containing a solution to help Captain Jack Sparrow find the dead man's chest, which holds the heart of Davy Jones. This project implements two heuristic algorithms, A* and DFS with backtracking, to navigate the challenges faced by Jack Sparrow while sailing in the Caribbean Sea.
Implementation of simple algorithms for AI like planning ang graph search
Øvinger fra TDAT2005 Algoritmer og datastrukturer, dataingeniør NTNU
This contains my Java based implementations for uninformed search strategies which inlcude BFS, DFS and A* algorithm in AI Spring 2018 class.
Heuristic - Blind Search algoritms for navigation and Minimax algorithm for a game
A Java-based implementation of various search algorithms to solve a marble puzzle game. The program finds the optimal path to move colored marbles on a 3x3 board from an initial state to a goal state. The algorithms implemented: BFS, DFID, A*, IDA* and DFBnB
Java project that demonstrates the Breadth First Search (BFS) and A* Search Algorithms.
Projeto do NetBeans contendo uma aplicação que permite ao usuário testar o algoritmo A*. O A* é um algoritmo de busca de caminho entre dois pontos a partir de uma malha definida. Nesta aplicação é utilizado o método de Manhattan para realizar o cálculo da heurística.
A*, Breadth First, Depth First, and Iterative Deepening Search
A Project demonstrating the Search Algorithms: BFS, DFS, DFID, A*(AStar), IDA*(IDAStar), DFBnB
Code for Breadth first search, uniform cost search, greedy best first search and A* algorithms to solve the 8 puzzles 3 x 3
John Conway's Game of Life implemention for sharks and pilchards.
Implementation of the 8-puzzle problem using A Star algorithm (Java)
Add a description, image, and links to the astar-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the astar-algorithm topic, visit your repo's landing page and select "manage topics."