On August 5, the organizing committee of SAT 2022 announced that the solver developed by Professor Kun He from the School of Computer Science and Technology of Huazhong University of Science and Technology (HUST), and her doctoral student Jiongzhi Zheng won the main track championship interest Competition 2022. The team members include master student Zhuo Chen, doctoral student Jianrong Zhou, and Professor Chumin Li from the University of Amiens in France, a long-time collaborator of the team and a visiting professor of HUST.

SAT problem is a classic problem in the field of computer science, and it is also the first problem proved to be NP-complete. It not only has important theoretical research value but also has a wide range of applications in the industrial field, especially in software and hardware verification. SAT Competition 2022 was organized by SAT 2022, the 25th International Conference on Satisfiability Testing Theory and Applications. The goal of the SAT Competition 2022, which has been held for 15 years, is to advance the development of the solution to the Boolean Satisfiability problem (SAT).

More than 50 solvers from Carnegie Mellon University, Eindhoven University of Technology, Shanghai Jiao Tong University, Dresden University of Technology, Sabanci University, John Kepler University, Russian ITMO University, Huawei Company and other internationally renowned universities and research institutes participated in the SAT Competition. Professor He Kun's team proposed an innovative method combining the random walk strategy with the decision tree model so that the solver can use different random walk strategies to assist in search when facing examples with different characteristics, which greatly improved the robustness of the SAT solver, and finally achieved the first place in the Main Track.