HCMUS - Artificial Intelligence - Lab01: Search Strategies
-
Updated
Jul 30, 2020 - Python
HCMUS - Artificial Intelligence - Lab01: Search Strategies
Solving crypt-arithmetic problems in Racket
Implemented Pacman Search Strategies : Breadth-First Search, Depth-First Search, Uniform Cost Search, A*.
Implementations of data structure, algorithms and search strategies, following the books: artificial intelligence a modern approach from norvig and russell; and data structure and algorithms from drozdek.
Learned both learning and problem solving to develop statistical models for real-world AI applications
solves state space search problems
A Classical Planning project.
A simple command-line Java program for solving the n-puzzle using various search strategies.
Search strings for finding SDG-related works per goal and target (python script, WoS search strategy)
This repository contains generic platform for solving and benchmarking computational puzzles using different search strategies
Add a description, image, and links to the search-strategies topic page so that developers can more easily learn about it.
To associate your repository with the search-strategies topic, visit your repo's landing page and select "manage topics."