Skip to content
#

hillclimbingalgorithm

Star

Here are 3 public repositories matching this topic...

coderkun12 / AI-Algorithms

Star 0

This repository contains codes for implementing Constraint satisfaction, A-star algorithm, hill-climb algorithm, BFS, DFS, Best first search, Magic square, Tic-Tac-Toe using magic square and the classic N-Queens problem

tic-tac-toe astar-algorithm pathfinding nqueens-problem breadth-first-search depth-first-search minimax-algorithm bestfirstsearch 8puzzle magicsquare graphcoloring waterjugproblem hillclimbingalgorithm cryptoarithmetics citydistanceproblem robotnavigation
  • Updated Jan 8, 2025
  • Python

Abrarulhassan-786 / Hill-Climbing-Algorithm

Star 0

A hill-climbing algorithm is an Artificial Intelligence (AI) algorithm that increases in value continuously until it achieves a peak solution. This algorithm is used to optimize mathematical problems and in other real-life applications like marketing and job scheduling.

ai algorithms artificial-intelligence hill flowchart hill-climbing hill-climbing-search hill-climbing-algorithm hillclimbingalgorithm
  • Updated Mar 29, 2023

Improve this page

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

Learn more