This repository aims to solve and create new problems from different spheres of coding. A path to help students to get access to solutions and discuss their doubts.

Prisoner's dilemma simulator including genetic algorithms for strategy evolution and a spatial variant of the iterated prisoner's dilemma game

Treasure hunt engine for PG Computational Geometry

A solver for the game spe_ed within the informatiCup:2021 contest from the German Informatics Society.

A small project for experiments on flexibility-representation in industrial factory settings.

This repository contains tools and programs used to conduct research into the emergence of cooperation in artificial social networks.

A genetic algorithm I did for a System of Agents course, two weeks efforts. It simulate the Axelrod championship between strategies for the iterated prisoner's dilemma in a evolutionist way.

ANAC competition / PappousAgent

Nash calculator (Game Theory)

Problem Statement of the project is To develop an ”Agent-based model for simulation of telecom services”. Following applications are also implemented : • Business Analysis • Risk Analysis

Recherche par heuristique du chemin le plus court pour gagner au solitaire

Game theory simulation of a cooperative game

A board game built in Java that incorporates an AI agent which works on minimax algorithm to play against humans. The game is commonly known as Mancala which is a two player turn based strategy game and features perfect information just like chess, tic-tac-toe, or Go. The minimax algorithm looks farther ahead from the current state of the game a…

Axelrod's Iterated Prisoners' Dilemma contests

A TicTacToe game implemented with the minimax algorithm.

A simple AI for a broader verison of the famous game "Tic-Tac-Toe"

A small desktop game that just won't let you win

CS 502042 assignment - Sudoku puzzle generator.

The first Android app in the Google Play Store implementing an optimal AI for the game of Quantum Tic-Tac-Toe.

This program simulates and quantifies outcomes of parameterized prisoner’s dilemma simulation in various MAS networks. This is the third lab in the series of 3 lab projects designed to introduce Multi-Agent Systems (MAS) as a base for Machine Learning.