Study efficiency of some backtracking algorithms

Abstract

In the qualification (bachelor's) work the efficiency of some backtracking algorithm is investigated. It is shown what types of algorithms and methods of their solution exist. AGraeco-Latin square as an example of the realization of the backtracking algorithm is implemented. It is established how the complexity of the algorithm affects on the execution time