Computational Complexity of Puzzles and Related Topics

Since the 1930s, mathematicians and computer scientists have been interested in computation. While investigate recursion theory, computational complexity based on Turing machine model to understand what a computation is. Beside them, there is another approach of research computation, which investigation puzzles games. Once we regard rules used games as set basic operations can perform some by solving playing In fact, from viewpoint theoretical science has continued without any break history science. Sometimes classes proceeded understanding tons puzzles. The wide collection complete problems for specific class shares common property, gives us deep class. this survey paper, give brief complexities with related results trends