摘要
求解棋盘中满足五子不相连的情况下需取出的最少棋子数,采用回溯法和递归的思想,从特殊到一般、二维到三维,先得出6×7、13×17棋盘至少需要抽出8、44个棋子。然后在三维网格空间中,对网络的13个方向上进行0-1整数规划处理。最后通过Lingo求解得到所需的棋子数为55。
The minimum number of pieces to be removed in the board to meet the five non-connected, the use of backtracking algorithm and recursive thinking, from special to general, two to three, first draw 6×7,13×17 the board at least need to withdraw 8,44 pieces.Then, in the three-dimensional grid space,0-1 integer programming is performed on the 13 directions of the network.Finally, the number of pieces required to get through Lingo is 55.
出处
《邵阳学院学报（自然科学版）》
2017年第5期8-13,共6页
Journal of Shaoyang University：Natural Science Edition
基金
湖南省自然基金项目(2015JJ2127)
中国国家自然基金项目(11126170)
湖南省普通高等学校教育教学改革项目(JG2014B048)
南华大学创新平台项目(5-2011-XQD-008)
