readme added

nikashahabi · Apr 2, 2021 · 4621be3 · 4621be3
1 parent 0408773
commit 4621be3
Show file tree

Hide file tree

Showing 1,065 changed files with 3 additions and 203,781 deletions.
diff --git a/README.md b/README.md
@@ -0,0 +1,3 @@
+# Using Simulated Annealing and Hill Climbing Algorithm to Solve the 8-Queen Problem
+
+The 8-queen Problem is solved with 3 different variants of the Hill Climbing Algorithm (Steepest Ascent, First Choice and Hill Climbing with Random Restart) and with Simulated Annealing. The initial checkered page (queen cells are showed with 1) or its dimention is passed to the methods when necessary. As in most Local Search Algorithms, we have used a complete-sate formulation of the problem. Meaning that in each state, all of the 8 queens are in the checkered page, and every column has exactly one queen in it. The queens are then allowed to move in their own column, making 8*7 successor for each state. 
diff --git a/venv/bin/activate b/venv/bin/activate
diff --git a/venv/bin/activate.csh b/venv/bin/activate.csh
diff --git a/venv/bin/activate.fish b/venv/bin/activate.fish
diff --git a/venv/bin/pip b/venv/bin/pip
diff --git a/venv/bin/pip3 b/venv/bin/pip3
diff --git a/venv/bin/pip3.7 b/venv/bin/pip3.7
diff --git a/venv/bin/python b/venv/bin/python
diff --git a/venv/bin/python3 b/venv/bin/python3
diff --git a/venv/bin/python3.7 b/venv/bin/python3.7
diff --git a/venv/lib/python3.7/site-packages/_distutils_hack/__init__.py b/venv/lib/python3.7/site-packages/_distutils_hack/__init__.py
diff --git a/venv/lib/python3.7/site-packages/_distutils_hack/__pycache__/__init__.cpython-37.pyc b/venv/lib/python3.7/site-packages/_distutils_hack/__pycache__/__init__.cpython-37.pyc
diff --git a/venv/lib/python3.7/site-packages/_distutils_hack/__pycache__/override.cpython-37.pyc b/venv/lib/python3.7/site-packages/_distutils_hack/__pycache__/override.cpython-37.pyc
diff --git a/venv/lib/python3.7/site-packages/_distutils_hack/override.py b/venv/lib/python3.7/site-packages/_distutils_hack/override.py
diff --git a/venv/lib/python3.7/site-packages/distutils-precedence.pth b/venv/lib/python3.7/site-packages/distutils-precedence.pth
diff --git a/venv/lib/python3.7/site-packages/pip-21.0.1.dist-info/INSTALLER b/venv/lib/python3.7/site-packages/pip-21.0.1.dist-info/INSTALLER
diff --git a/venv/lib/python3.7/site-packages/pip-21.0.1.dist-info/LICENSE.txt b/venv/lib/python3.7/site-packages/pip-21.0.1.dist-info/LICENSE.txt
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,3 @@
		# Using Simulated Annealing and Hill Climbing Algorithm to Solve the 8-Queen Problem

		The 8-queen Problem is solved with 3 different variants of the Hill Climbing Algorithm (Steepest Ascent, First Choice and Hill Climbing with Random Restart) and with Simulated Annealing. The initial checkered page (queen cells are showed with 1) or its dimention is passed to the methods when necessary. As in most Local Search Algorithms, we have used a complete-sate formulation of the problem. Meaning that in each state, all of the 8 queens are in the checkered page, and every column has exactly one queen in it. The queens are then allowed to move in their own column, making 8*7 successor for each state.