搜索资源列表
chess_cover
- 分治法解决棋盘覆盖问题。使用C#，可自定义棋盘大小。每个棋盘用若干L型块覆盖-Divide and conquer method to solve the coverage problem board. Using C#, customizable board size. Each board covered with a number of L-block
ChessBoard
- 用分治法，一个棋盘，提供一个特殊方格用黑色填充，其余用L型方块填满。-Using divide and conquer, a board, a special box filled with black, the other filled with the L-type box.
qipanfugai_CPP
- 用C++编写的棋盘覆盖问题的解决，其中有非常清楚的注释，帮助学习者了解分治法在类似问题中的应用-Board cover solution written in C++, which has a very clear comments to help students understand the divide and conquer those problems
qipanfugai_matlab
- 用matlab编写的棋盘覆盖问题的解决，有清楚的注释，帮助学习者了解分治法在类似问题中的应用-Matlab prepared by the board covering problems, clear notes, to help students understand the divide and conquer similar problems
FillBoard
- MFC实现的填充棋盘小程序，鼠标单击窗口任一点，即时生成填充棋盘的解法。填充算法使用分治法。-Fill the chessboard small program is implemented by MFC, mouse click the window at any point, the solution immediately generated to fill the board. Filling algorithm using the divide and conquer.