Fast and simple heuristic for solving travelling-salesman-problem. Combined HC and path trasformation.
-
Updated
Nov 1, 2022 - C++
Fast and simple heuristic for solving travelling-salesman-problem. Combined HC and path trasformation.
Solution to the N-Queen problem, using a Hill Climbing approach
N-Queen problem solver application at Artificial Intelligence (slo. Umetna Inteligenca)
Forward checking with MRV and Hill climbing algorithm with Min-conflicts
Assignements in genetic algorithms class
Decrypting substitution cipher encrypted text without knowing the cipher pattern
Backing up codes I wrote, during my Artificial Intelligence course.
Solving N-Queens problem using Hill Climbing approach
Second project developed for Artificial Intelligence class
Solving Sudoku boards using stochastic methods and genetic algorithms
Using Hill Climbing to minimize various functions
Fuzz testing harness for Geometrize, a library for geometrizing images into geometric primitives
Unit tests for Geometrize, a library for geometrizing images into geometric primitives
Telecom spectrum allocation problem using greedy hill climbing search
This project is coding for fun. It will be using heuristic and metaheuristic algorithm to optimize problems. All code will be conducted by c++.
Reproduce images using geometric primitives
Enigma cipher tool
Add a description, image, and links to the hill-climbing topic page so that developers can more easily learn about it.
To associate your repository with the hill-climbing topic, visit your repo's landing page and select "manage topics."