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.
Italian notes for the course of "Heuristic Algorithms", LateX, A.A. 2021/2022 for M.Sc.'s in Computer Science.
Algorithm analysis of NP-Hard problem called Maximum Set Packing.
Proof Based Algorithms HW (CPSC 365) with Professor Andre Wibisono
Add a description, image, and links to the np-problems topic page so that developers can more easily learn about it.
To associate your repository with the np-problems topic, visit your repo's landing page and select "manage topics."