Missionaries and cannibals problem resolved with Breadth-First Search
-
Updated
Jun 17, 2015 - Python
Missionaries and cannibals problem resolved with Breadth-First Search
Breadth First Search(BFS) implementation using python 2.7
Solver for the Rush Hour Game based on the Breadth First Search algorithm
A python library for solving combinatorial search problems
8 puzzle game solved by an AI!
Lab: Teaching Pac-Man to Search | Artificial Intelligence Nanodegree | Udacity
Implementation of reinforcement learning algorithms to solve pacman game. Part of CS188 AI course from UC Berkeley.
implementation of the common graph algorithms
BFS, Dijkstra, Best First Search, A*
☁️ Simple Sokoban Solver written in Python along with AI logic implementation
Spare time stuff
Basic search Algorithm for Pacman. DFS, BFS, UCS & Heuristic, Food & Corner Heuristic
solve deterministic logistics planning problems for an Air Cargo transport system using a planning search agent
An adversarial planning search for air cargo problems
In this project, the Pac-Man agent finds paths through its maze world, both to reach a particular location and to collect food efficiently. Search algorithms such as Depth First Search, Bread First Search, Uniform Cost Search and A-star search are applied to Pac-Man scenarios.
A project that applies several Artificial Intelligence techniques such as informed state space search, reinforcement learning and probabilistic inference. Algorithms such as Depth First Search, Breadth First Search, Uniform Cost Search, A-star Search enabled the pacman to win in different game versions
🎮 A set of artificially intelligent Pacman agents, using different search strategies!
CSE537 under IV Ramakrishnan
CSE 571 Artificial Intelligence
Add a description, image, and links to the breadth-first-search topic page so that developers can more easily learn about it.
To associate your repository with the breadth-first-search topic, visit your repo's landing page and select "manage topics."