Then there is an optimal algorithm and random backtracking algorithm was designed.
最后设计实现了MCSP问题的最优解算法与随机回溯算法。
参考来源 - 最小公共字符串划分问题的算法研究·2,447,543篇论文数据，部分数据来源于NoteExpress
This is the strategy to avoid the need of a backtracking algorithm.
这是策略，避免了回溯算法的需要。
Eight queens problem is an ancient and well-known problem, backtracking algorithm is a typical example.
八皇后问题，是一个古老而著名的问题，是回溯算法的典型例题。
Traditional backtracking algorithm has been improved by rotating the chessboard matrix and put into solving N-queens counting problem in computer cluster.
通过对n皇后问题棋盘矩阵的旋转，改进了回溯算法，并通过计算机集群并行实现了N皇后的计数问题。
应用推荐