The individual components of the CSP solver must be combined into a single implementation. This single implementation will take and input, adjust the data structures to the form which allows the highest optimization (using the implementations from #31), form a CSP solver (using the implementations in #13, #14, #12, #11), and return a solution (a valid schedule).
We must have a function that accepts the inputs outlined in the algorithm 1 specification and outputs a complete schedule with no violated constraints OR an error code with an empty schedule object.
Related tickets:
11, #12, #13, #14, #34
Acceptance Criteria
[x] The complete algorithm 1 implementation is usable takes an input matching the algorithm 1 specification
[x] All hard constraints are used
[x] An optimized search algorithm is used
[x] As many soft constraints are taken into account as possible
[x] The runtime is reasonable if successful
[ ] The error cases implementations as defined in #34 are used
[x] The output matches the algorithm 1 specification
Description
The individual components of the CSP solver must be combined into a single implementation. This single implementation will take and input, adjust the data structures to the form which allows the highest optimization (using the implementations from #31), form a CSP solver (using the implementations in #13, #14, #12, #11), and return a solution (a valid schedule).
We must have a function that accepts the inputs outlined in the algorithm 1 specification and outputs a complete schedule with no violated constraints OR an error code with an empty schedule object.
Related tickets:
11, #12, #13, #14, #34
Acceptance Criteria
Additional Resources
Add attachments, external links, etc here.