Program Description:

This prolog program is made for solving crypto problems using exhaustive method. To solve a crypto problems, this program mainly uses recursive method that calls the 2,3,4,5 solvers to try to find solutions within the scope. it can also generate a random problem to solve whiten the scope of 0-9, after solving the problem, the program will store the latest result into the knowledge base. Unlike heuristic solver, this program will take longer the time to solver a similar problem with more memory print, but it can solve any problem that has a possible solution since it's going through every possible combinations to find a suitable solution. When there is no solution for the tarted problem, variable "none" will be recored and inserted into the knowledge base.