Solving Class Scheduling problem using the CSP method.
At main.cpp you can manually create any of objects:
- Group
- Teacher
- Room
- Subject
- Day
- Forward Checking
- Minimum Remaining Values Heuristic
- Degree Heuristic
- Least Constraining Value Heuristic
The most powerful heuristic was the combination of Forward Checking and Minimum Remaining Values Heuristic.
Also, I added a couple of small optimization like considering only non-used variables, storing the pointer to object instead of copying it. Also using set and map C++ data structures to optimize look-up, finding, or erasing objects.
Because CSP solver works pretty fast due to constraining (5 days, 4 lessons, 4 groups, 9 subjects, 6 rooms, 8 teachers). I've run solver 100 times using profile.h file to measure the time. Least Constraining Value Heuristic showed itself the worse, probably it's because of small constraining and selected CSP variables and domains.
Example of the part of the generated output:
| Monday | Tuesday |
|---|---|
 |
 |