This assignment is testing backtracking. Your code should step through, location by location in

the star, through the $12$ locations and try all of the possible numbers that are not yet filled in$.$

Clearly, trying all possibilities leads to $12!$ possible options, which would take too long to evaluate.

Thus, in some instances, you may be able to decide that even though a number hasn$$t been placed

yet, it$$s impossible for it to be in the current slot and for the puzzle to be solvable.

Hint: There is a way to determine the magic sum before placing any numbers!

If you code the problem appropriately, then any individual puzzle should be solved in under a

second. Our input has $80$ test cases. The total time limit will be set to three times my $($Arup$$s$)$

solution.