✏️ Algorithm to solve sudoku with heuristic

An implementation of the SAS+ planning language in Java, as described in Malte Helmert's paper "A Planning Heuristic Based on Causal Graph Analysis", and the latter "Unifying the Causal Graph and Additive Heuristics" with Hector Geffner.

Game Agent implementation and Heuristic Analysis

A heuristic hard thresholding algorithm to handle the robust least squares regression with adversarial corruption

Some assignments done during my undergraduate course.

Heuristics for creating casts with the minimum amount of actors.

Linear Programming and Heuristics examples applied to Transportation problems

travel salesman problem

Extract cryptocurrency addresses from big datasets

Travelling Salesman Problem solved using Backtracking, and approximation algorithms such as: Triangular Approximation Heuristic, Closest Neighbour Heuristic and our own heuristic! Developed in C++ for the subject: "Design of Algorithms"

8 Puzzle Solver Using Classical Search Algorithms: DFS | BFS | A*

Simple Python project that uses standard libraries in conjunction with PyGame for the GUI. Allows the user to create a maze using their mouse, define starting position [S_i,S_j], goal position [G_i,G_j], and run different pathfinding algorithm visualizations from informed (Greedy, A*) to uninformed (DFS,BFS) and choose between L1 and L2 heuristics

This project is coding for fun. It will be using heuristic and metaheuristic algorithm to optimize problems. All code will be conducted by c++.

This repository applies various optimization techniques to solve the Flow Shop Scheduling Problem (FSSP), from brute force solutions to advanced metaheuristics and our own solution named FSSP-DQN.

Implementation of a solution to Jdata GOC

Data and Code for Article

Pathfinding Algorithm for Obstacle-Rich Boards

This is a Java implementation of the game Omega with Human versus AI players and different maps

This program will approximate the Traveling salesman problem using 3 three different algorithms (Nearest Neighbot, 2Opt, and 3Opt). There are 6 different combinations and each can be run individually or in suite as part of a benchmark test.

Traveling Salesman Problem Framework