Scala game created with ScalaFX from scratch. The game is a variation of an edge matching puzzle – included in the file is a backtracking algorithm to solve the NP problem in O(M^N) time, where M is the number of fitting triangles for each location which varies based off heuristics.

Python scripts that tackle classic NP problems like the Traveling Salesman and 0/1 Knapsack using basic algorithmic approaches.

Code written for lectures and homework in USC CSCI570-Analysis-of-Algorithms Course 🚀🚀🚀

Algorithm analysis of NP-Hard problem called Maximum Set Packing.

Visualize NP-completeness of TSP algorithm using 3D-Force-Directed Graphs.

Italian notes for the course of "Heuristic Algorithms", LateX, A.A. 2021/2022 for M.Sc.'s in Computer Science.

Proof Based Algorithms HW (CPSC 365) with Professor Andre Wibisono