Chessboard Coverage Teaching Based on Divide-and-Conquer Algorithm

Zhijie Li, Feixue Huang, Xiangdong Liu and Xiaodong Duan

Modern Applied Science, 2010, vol. 4, issue 1, 36

Abstract: Though the divide-and-conquer algorithm is a powerful technology, but it is difficult to be used in practice, so the design of this algorithm should be regulated in the teaching. In this article, the teaching process and the characters of the divide-and-conquer algorithm are studied when solving the problem of chessboard coverage. Aiming at the deficiency that the existing teaching method uses skills in decomposing sub-problems and increases the teaching difficulty, the coverage sequence of L-type dominoes is improved. The improved algorithm can keep consistent with the divide-and conquer strategy and standardize the iterative process, and increase the normative character and the consistence of the algorithm, and hence achieve ideal teaching result.

Date: 2010
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://ccsenet.org/journal/index.php/mas/article/download/4833/4082 (application/pdf)
https://ccsenet.org/journal/index.php/mas/article/view/4833 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:masjnl:v:4:y:2010:i:1:p:36

Access Statistics for this article

More articles in Modern Applied Science from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().