摘要
五连珠是五子棋中抽象出来的问题,本文通过对五连珠问题的研究与求解,得到了在二维棋盘中,去掉最少棋子,以达到整个棋盘在横、竖、斜三个方向都不出现五子连珠的方法。
Five pieces in a row is a problem abstracted from gob-ang. By researching and solving the problem of five pieces inarow, the writer get the method of eliminating five pieces ina rowin horizontal, vertical and oblique directions in a two-dimension-al chessboard by removing the least pieces.
出处
《科教文汇》
2018年第4期61-62,共2页
Journal of Science and Education
关键词
抽屉原理
N皇后问题
贪心算法
回溯算法分治法
drawer principle
N-Queen Problem
greedy algo-rithm
backtracking algorithm
divide and conquer algorithm
