Constraint satisfaction problem is one of the most basic NP-complete problems in artificial intelligence. Over the years, with the in-depth study of constraint satisfaction problem, scholars at home and abroad have proposed a variety of case models. RB model is an example of growth domain constraint satisfaction problem with precise phase transition, which is very challenging to solve. In order to find a new efficient algorithm and promote the research of RB model algorithm for constraint satisfiability problem, firstly, this paper analyzed the model development and solving techniques of constraint satisfaction problem. Secondly, it sorted out various examples of RB model solving algorithms, and divided the solving algorithm literature into backtracking heuristic, information propagation and meta-heuristic related improved algorithms. This paper compared and summarized the algorithm principles, improved strategies, convergence and accuracy. Finally, it gave the research trend and development direction of solving RB model example algorithm.

[2023-01-18] Accepted Paper /doc/2022.11.0567/v1

[2023-07-05] Printed Article /doc/2022.11.0567/v2