Backtracking

SassyNic uses Backtracking Algorithm to Prune data (extracted class details). As Figure 1 shown below, the condition(s) of a valid solution/timetable can be found such as these base conditions are met:

1. The solution must use at least one class from each set
2. The solution must uses one and only one class from each set
3. The solution must have at least 2 sets involved
4. The solution must not consist day and time conflict within each sets
5. The solution must not consist where set(s)'s seats are not available

set(s): cours(es)/subject(s)

Figure 1: Backtracking Algorithm