#

stochastic-hill-climb

Here are 3 public repositories matching this topic...

MaxJuniorr / eight-queens-puzzle

This repository contains a solution to the classic Eight Queens Puzzle, a combinatorial problem where the objective is to place eight queens on a standard chessboard (8x8) so that no two queens threaten each other. This means that no two queens can share the same row, column, or diagonal.

backtracking-algorithm eight-queens-puzzle stochastic-hill-climb

Updated Sep 8, 2024
Python

MohammadYasinKarbasian / MAX-SAT-solver

My MAX-SAT solver uses stochastic local search, tabu search, and simulated annealing.

python simulated-annealing tabu-search stochastic-hill-climb max-sat

Updated Dec 13, 2022
Python

feknall / n-queens-algorithms

Implementation of famous search algorithms for the N-Queen problem.

algorithm n-queens stochastic-hill-climb steepest-ascent

Updated Nov 14, 2021
Python

Improve this page

Add a description, image, and links to the stochastic-hill-climb topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the stochastic-hill-climb topic, visit your repo's landing page and select "manage topics."