As a developer of the CSP implementation I would like a function to perform the actual search for a schedule of assigned variables that does not violate the constraints.
Description
After formulating the constraint satisfaction variables, domains, and constraints, a search needs to be performed to find a solution. It is critical that this search is performed with optimal runtime complexity in mind, as this step has the potential to run for extremely long periods of time.
Related Issues
Blocked by #12
Acceptance Criteria
[x] The search algorithm (backtracking) has been implemented
User Story
As a developer of the CSP implementation I would like a function to perform the actual search for a schedule of assigned variables that does not violate the constraints.
Description
After formulating the constraint satisfaction variables, domains, and constraints, a search needs to be performed to find a solution. It is critical that this search is performed with optimal runtime complexity in mind, as this step has the potential to run for extremely long periods of time.
Related Issues
Blocked by #12
Acceptance Criteria
Additional Resources
Add attachments, external links, etc here.