https://github.com/ghazaleze/artificial-intelligence
codes of my IUT course
https://github.com/ghazaleze/artificial-intelligence
0-1-knapsack-problem choco-solver constraint-satisfaction-problem csp-solver game-theory hill-climbing-search max-sat metaheuristics minizinc random-restart tabu-search
Last synced: 11 months ago
JSON representation
codes of my IUT course
- Host: GitHub
- URL: https://github.com/ghazaleze/artificial-intelligence
- Owner: GhazaleZe
- License: mit
- Created: 2020-11-15T15:06:17.000Z (over 5 years ago)
- Default Branch: main
- Last Pushed: 2021-02-28T06:22:28.000Z (over 5 years ago)
- Last Synced: 2025-07-14T20:08:43.890Z (11 months ago)
- Topics: 0-1-knapsack-problem, choco-solver, constraint-satisfaction-problem, csp-solver, game-theory, hill-climbing-search, max-sat, metaheuristics, minizinc, random-restart, tabu-search
- Language: Python
- Homepage:
- Size: 64.5 KB
- Stars: 7
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Artificial-Intelligence
If you hava something to say join [Discussion](https://github.com/GhazaleZe/Artificial-Intelligence/discussions).
## [Local Search](https://github.com/GhazaleZe/Artificial-Intelligence/tree/main/local_search): :relaxed:
### Requirement
- python3.x
- Although it's not necessary, I use Pycharm mostly for coding python.
### Solved Problems
In local_seach file:
The **max sat problem** is solved with **Random Restart Hill Climbing**.
The **0-1 knapsack problem** is sovled with **Tabu Search**.
## [CSP](https://github.com/GhazaleZe/Artificial-Intelligence/tree/main/CSP): :heart_eyes:
### Course Scheduling Problem
#### Requirement
- [MiniZinc](https://www.minizinc.org/)
#### Explanation of the solution
Problem:
There is 5 course in 3 fix days of each week. Course Scheduling is like this:
- course1 : 8-9AM
- course2 : 8:30-9:30 AM
- course3 : 9-10 AM
- course4 : 9-10 AM
- course5 : 9:30-10:30 AM
There are 3 teachers who can teach specific courses like:
- Teacher A: courses 3,4
- Teacher B: courses 2,3,4,5
- Teacher C: all courses
**Solution** is in **Courses.mzn**
### N-Queen with minizinc
#### Requirement
- [MiniZinc](https://www.minizinc.org/)
#### Explanation of the solution
- This is a famous n-queen problem which n in the input and n * n board after placing n queen in the output.
- soulution is in **n_queen.mzn** file.
### Orthogonal Latin Square with Choco
#### Requirement
- I used [IntelliJ IDEA](https://www.jetbrains.com/idea/download/#section=windows) for java programming.
- You need [choco solver](https://github.com/chocoteam/choco-solver), I downloaded [choco-parsers-4.10.6-jar-with-dependencies.jar](https://github.com/chocoteam/choco-solver/releases/download/4.10.6/choco-parsers-4.10.6-jar-with-dependencies.jar) file and add it to my IntelliJ IDEA project.
#### Explanation of the solution
**Solution** is in **OLS_CSP.java**
## [Inference: working with Maple](https://github.com/GhazaleZe/Artificial-Intelligence/blob/main/ghazale.mw)
- Input: DNF
- Goal: Transfer DNF to CNF and check satisfiability.
- Soulution is ghazale.mw
## Support
ghazalze@yahoo.com
Thanks [@arman324](https://github.com/arman324) :sweat_smile: