This repository contains solutions for the AI-1 Systems Project assignments from the Winter Semester 2023/2024 at Friedrich-Alexander-Universität Erlangen-Nürnberg. The project covers various topics in artificial intelligence, including adversarial search, graph algorithms, planning, and agent-based systems.

1. FAUhalma Game Agent
2. Find the Best Train Connection
3. Escape the Wumpus Cave
4. Clean the Wumpus Cave

This assignment focuses on implementing an agent for the FAUhalma game, a variant of Sternhalma/Chinese checkers. The agent competes on a server, aiming to move its pegs into the opposite corner (home) as quickly as possible. The solution utilizes the Minimax algorithm with Alpha-Beta pruning to determine the best moves for the agent.

For detailed information and instructions on running the FAUhalma Game Agent, please refer to the FAUhalma Game Agent README.

The objective of this assignment is to find the best train connections between two places in India using different cost functions. The project involves working with graphs, solving a large real dataset search problem, implementing efficient algorithms, understanding the impact of cost functions on search algorithms, and handling CSV file formats.

For detailed information and instructions on running the Train Connection Finder, please refer to the Find the Best Train Connection README.

This assignment challenges students to navigate an agent out of a treacherous Wumpus world using Planning Domain Definition Language (PDDL) planning. The project emphasizes the understanding of PDDL, encoding of planning problems, and the utilization of planners to find solutions.

For detailed information and instructions on running the Escape the Wumpus Cave solution, please refer to the Escape the Wumpus Cave README.

The goal of this assignment is to navigate a vacuum cleaner robot through the Wumpus cave, efficiently cleaning the area through a series of instructions. The project focuses on the application of agents in AI search within a simulated environment, requiring the development of optimal instruction sequences for cleaning the cave.

For detailed information and instructions on running the Clean the Wumpus Cave solution, please refer to the Clean the Wumpus Cave README.

Each assignment has its own set of dependencies and setup instructions. Please refer to the individual README files linked above for specific details on installing and running each solution.

Contributions to improve the solutions or extend the projects are welcome. Please ensure to follow the existing code structure and update documentation as necessary.

We would like to express our gratitude to the course instructors and teaching assistants for their guidance and support throughout the AI-1 Systems Project.