fenzhi_src

代码说明：

  棋盘覆盖问题 设一个n*n棋盘，n=2k,用L 型条块覆盖棋盘中除一个指定方格外的所有方格，每个L型条块可恰好覆盖3 个方格。 实验内容：设计分治算法实现棋盘覆盖,要求图形化。(Board covering the establishment of a n* n chessboard, n = 2k, with the L-slice coverage for a specified board, in addition to all the extra square grid, each slice can be exactly covered by L-3 grid. Experiment: Design of the board covering the partition algorithm to require graphic.)

文件列表：

fenzhi_src
..........\.classpath,232,2009-10-11
..........\.project,384,2009-10-11
..........\bin
..........\...\test1
..........\...\.....\Draw.class,5781,2009-10-17
..........\...\.....\Myevent.class,5550,2009-10-17
..........\...\.....\OverException.class,478,2009-10-12
..........\...\.....\Test1.class,3181,2009-10-17
..........\src
..........\...\test1
..........\...\.....\OverException.java,196,2009-10-11
..........\...\.....\Test1.java,17234,2009-10-17