A Python 3.4 implementation of the classic game, Hunt the Wumpus where we tromp around through a cave of 20 rooms trying to hunt down a fictional creature called the Wumpus while avoiding hazards. Implemented using aima3, fol, querying the KB.
A KenKen python solver that represents the game as a Constraint Satisfaction Problem (CSP) and can use several algorithms for its solution.
Project for the MSc in Artificial Intelligence of the University of Bologna, academic year 2023/2024. Tablut Challenge from the Fundamentals of Artificial Intelligence and Knowledge Representation course
📻📡 Solving the Constraint Satisfaction Radio Link Frequency Assignment Problem, using FC and MAC algorithms with the dom/wdeg heuristic. An attempt to solve it with MIN-CONFLICTS algorithm and some comparisons are also made.
"Artificial Intelligence - A Modern Approach - Third Edition"
N-Queens Problem, CSP problem, Minisat, Min-Conflicts, Hill-Climbing Search, Backtracking Search
An implementation of the UC Berkeley's "Introduction to Artificial Intelligence" (CS 188) course's Pac-Man project.
Based on The Same Game, from Simon Tatham's Portable Puzzle Collection. Created as the final project for the Artificial Intelligence class at Belmont University, Fall 2018 Semester.
Python 3.11 implementation of the exercises from "Artificial Intelligence: A Modern Approach" (4e) - Russell & Norvig
RLFA Problem AIMA Python
A simple kakuro CSP problem solver from AIMA python https://github.com/aimacode/aima-python
A Kenken puzzle generator & solver
🦎 Basic python stuff.
Add a description, image, and links to the aima-python topic page so that developers can more easily learn about it.
To associate your repository with the aima-python topic, visit your repo's landing page and select "manage topics."