Randomized Heuristic for the Maximum Clique Problem

Implementation of the A* algorithm for solving the 15-piece board game

Two different methods are being utilized to solve this famous puzzle. They are backtracking and genetic algorithms. The second approach is still in development. Backtracking method seems to be faster, but GA delivers more consistent results for a diverse palette of starting positions. All in all, a very interesting project to me personally.

This repository contains routing heuristic algorithm implementation and data analysis of Cremona's bibliotecary network

Application Data Distribution in Edge Computing

Python script to solve sudoku puzzles (2016)

A visualizer for various path finding algorithms on 3 different grid sizes, with custom maze building feature, made with pure python and pygame.

Implement a Planning Search for Air Cargo Problem

焼きなましの復習

Solving the Sliding puzzle with 8 pieces using A* algorithm

A heuristic based sudoku solver

Harmony Search algorithm implemented in python with object oriented programming.

Global Affectation Problem, solved via a tabu search heuristic

Artificial Intelligence Search algorithms (A*, BFS, DFS, UC)

CRYPTO - Linear Cryptanalysis of Reduced-Round Speck with a Heuristic Approach: Automatic Search for Linear Trails

Solutions to CS235 Artificial Intelligence Course. Total four assignments.

In this pure javascript demo, you will be able to see the most famous path-finding algrithms in action, with nice animations and intuitive customizations of the paths!

A Tic-Tac-Toe game which can be play against 2 different agent (Rule-Based, Heuristic) created with python Tkinter.

A fast 3/4-Puzzle solver written in C++