-
Notifications
You must be signed in to change notification settings - Fork 0
Generating university schedule, which is represented as constraint-satisfaction problem. For better efficiency, minimum-remaining-values heuristic, degree heuristic, least-constraining-value heuristic, forward checking heuristic and constraint propagation heuristic are realized.
lizaboiarchuk/csp-timetable
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
Generating university schedule, which is represented as constraint-satisfaction problem. For better efficiency, minimum-remaining-values heuristic, degree heuristic, least-constraining-value heuristic, forward checking heuristic and constraint propagation heuristic are realized. To run this program you have to complete next steps: 1. Go to the directory where you want to save the project and run the command: $ git clone https://github.com/vrshchk/timetableCSP.git 2. Install neccessery library: $ pip install prettytable 3. Go to the downloaded directory and run the command: $ python main.py
About
Generating university schedule, which is represented as constraint-satisfaction problem. For better efficiency, minimum-remaining-values heuristic, degree heuristic, least-constraining-value heuristic, forward checking heuristic and constraint propagation heuristic are realized.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published