A new optimization algorithm and its application — Key cutting algorithm

From the procedure how a locksmith match a key to a lock, a new algorithm called the "key-cutting algorithm" is introduced. There are so many existing algorithms for solving the optimization problem like genetic algorithm, linear programming and the artificial immune algorithm. For any problem these algorithms would apply, so does the key-cutting algorithm. At the same time, some already known information can be taken into account with the algorithm; it gives a much faster convergent speed. Firstly, the basic principle and steps are given. Secondly, an interesting example — a 9 number puzzle problem is used to demonstrate how to use the algorithm. The artificial intelligence problem is first transformed to an optimization problem, then uses the basic key-maker and advanced key-cutting algorithm to solve the problem and result analysis is provided. Lastly, it compares the algorithm with genetic algorithm.