Skip to content
#

hill-climbing-search

Star

Here are 95 public repositories matching this topic...

Language: All
Filter by language
All 95 Python 44 Jupyter Notebook 16 Java 15 C++ 7 JavaScript 5 C 1 C# 1 Fortran 1 HTML 1 Ruby 1
Sort: Most stars
Sort options
Most stars Fewest stars Most forks Fewest forks Recently updated Least recently updated

biqar / puzzle-solver

Sponsor
Star 14

This repository contains generic platform for solving and benchmarking computational puzzles using different search strategies

csp algorithm puzzle-game hill-climbing-search backtracking-search 8-puzzle graph-coloring puzzle-solver forward-checking search-strategies 8-puzzle-solver map-coloring heuristic-functions uninformed-search n-queens-problem problem-solving-techniques n-queen 8-queens-problem solving-puzzles
  • Updated Oct 31, 2021
  • C++

gazalpatel / Eclipse-Projects

Star 4

This repository includes java algorithms and java projects. Code is self explanatory and created using core java concepts in Eclipse Editor. This files are compatible for command line run. Algorithms are demonstrated and explained in comments at end of of main application files.

java algorithm algorithms eclipse astar-algorithm basic-learning stochastic dfs brute-force search-algorithm bfs searching-algorithms hill-climbing-search core-java dfs-algorithm iddfs-algorithm corejava localserver bfs-algorithm basic-programming-language
  • Updated Apr 20, 2017
  • Java

apurva-modi / CS580-Intro-to-Artificial-Intelligence

Star 2

Contains notebook implementations for the AI based assignments using graph based algorithms that are commonly used in solving AI based problems. Algorithms include BFS, DFS, Hill Climbing, Differential Evolution, Genetic, Back Tracking..

neural-network algorithms genetic-algorithm artificial-intelligence sudoku-solver dfs dynamic-programming bfs hill-climbing-search othello-game forward-checking heuristic-search-algorithms backtracking-algorithm travelling-salesman-problem
  • Updated Feb 4, 2020
  • Jupyter Notebook

HxnDev / N-Queen-Problem-using-Hill-Climbing-and-Simulated-Annealing

Star 2

Hill climbing algorithm is a local search algorithm which continuously moves in the direction of increasing elevation/value to find the peak of the mountain or best solution to the problem. Simulated annealing is a probabilistic technique for approximating the global optimum of a given function.

algorithm code jupyter-notebook pyhton problem-solving simulated-annealing hill-climbing hill-climbing-search n-queens google-collab
  • Updated Jul 24, 2021
  • Jupyter Notebook

SubhangiSati / Neural-Network

Star 2

This consist codes like Artificial Neural Network, CNN, RNN, Activation function, Hill climbing and tower of Hanoi and various others. This will provide you a knowledge of Neural Networks, libraries like tensorflow, numpy, pandas, matplotlib, seaborn, pytorch, sci-kit learn etc

python data-science neural-network recurrent-neural-networks artificial-intelligence data-analytics artificial-neural-networks convolutional-neural-networks problem-solving hill-climbing-search
  • Updated Feb 10, 2024
  • Jupyter Notebook

Improve this page

Add a description, image, and links to the hill-climbing-search 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 hill-climbing-search topic, visit your repo's landing page and select "manage topics."

Learn more