Solves puzzles of various sizes
-
Updated
Nov 10, 2022 - C++
Solves puzzles of various sizes
A* algorithm-based route planner built in C++ using IO2D library (Udacity C++ Nanodegree).
A program in C++ that creates a pseudo-random Rubik Cube and tries to solve it using the A* Algorithm.
ENPM809Y Final Project
Graduate level Artificial Intelligence coursework
A route planner that can find a path between any two points on a real map of a real city using io2d library , google teste library for testing and pugixml for parsing xml files from open street map data to the project.
This repository contains my solutions to the assignments of the course CSE-318 | Artificial Intelligence.
This code solves the 8 puzzle problem with A star algorithm.
Project for Programming Laboratory @ Unifi - A* Algorithm in a grid (SFML graphics).
Generic A star (A*) incremental algorithm
An Artificial Intelligence project to find a pathway through a cavern with N paths (Edinburgh Napier, Artificial Intelligence Module Coursework)
This repository contains the codes of my academic course CSE366-Artificial Intelligence. The problems are solved using the C++ language.
This was my first Udacity project, that required me to implement A* search to find a path between two points, just as you might see in a desktop or mobile mapping application.
AI path planner program that utilizes a multitude of algorithms, including the A* Search algorithm.
Implementation of the A Star Search Algorithm in C++ and QT to find the shortest path between two positions.
An AI gym for building, measuring, and learning agents in massively parallel fuzzed environments using the Chinese Room Abstract Stack (Crabs) machine, ASCII Data Types, and Script2.
Udacity Route Planning Project
Implementing the A* algorithm in C++ to find a path on a map
Add a description, image, and links to the a-star-search topic page so that developers can more easily learn about it.
To associate your repository with the a-star-search topic, visit your repo's landing page and select "manage topics."