搜索资源列表
mj-1.7-win32-i386
- The game currently implemented is a version of the classical Chinese windows下的执行文件（还有dll在另一文件 内）-The game currently implemented is a versio n of the classical Chinese windows of the implementation document (also dl l In another document)
fish
- 深海捕鱼，网狐6.6下完美运行，完整无错无BUG版-Deep-sea fishing, the net perfect run in fox 6.6
knight
- 骑士周游世界问题 ， 一个称为骑士的棋子，能否在64个放个的棋盘上都走一次且只走一次？在国际象棋中骑士的移动路线是L型的（在一个方向上走两格，在垂直方向上走一格）-Cavalier travel around the world is an issue known as the Cavalier pawn can take 64 months left of the chessboard once and only go once? Cavalier in the international c
ZDX-L-Engine1.0
- ZDX平台游戏套件1.0 演示 http://zhaodexian007.w37.cndns.com/-ZDX Suite 1.0 platform game demo http://zhaodexian007.w37.cndns.com/
COLOR
- 棋盘覆盖问题。用L型方块覆盖指定大小的画布-Board cover problem. L-box with the specified size of the canvas cover
ChessHorse
- 在一个具有8×8个方格的国际象棋盘上，从棋盘的任何一个方格开始，让马按照允许的走步规则（L形走法）走遍所有方格，每个方格至少并且只准走过一次。-In an 8 × 8 squares on the international chess board,start from any squar of chess board,Walking the horse in accordance with the rules allowed (L-shaped moves) traveled all the
wuziqi
- 一个简朴的五子棋游戏，希望你能喜欢!游戏规则: 玩家1和玩家2轮流在棋盘(19X19)上任意空闲位置(没有棋子)放置一个棋子,放置的方法是输入要放置的棋子的位置(即该棋子所在的行的序号和所在的列的序号,棋盘中L、R分别表示行(Line)、列((Row)),同一玩家所放棋子中任意五个或五个以上棋子较先呈现连续在同一直线(四种形式|、-、/、\\)上的玩家获胜 游戏操作: 1)在游戏主菜单“Game_Menu”中输入相应的数字并回车即可执行相应的操作，第一次玩请先输入5并回车查看游戏帮
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.
Chessfugai
- 实现n*n期棋盘的L型骨牌覆盖问题，可输入棋盘规格，特殊位置，输出覆盖结果-Implementation period of n* n board the L-shaped dominoes cover problem, enter the board size, specific location, output coverage results
Knight
- 在一个具有8×8个方格的国际象棋盘上，从棋盘的任何一个方格。开始，让马按照允许的走步规则（L形走法）走遍所有方格，每个方格至少并且只准走过一次。试设计一个算法实现这个有趣的问题。-Sorry, I don t know how to translate.
search
- 在西洋棋中的武士（knight）与象棋中的马相似，走的是L型路线，输入一个表示期盼的大小值n，在输入一个起点坐标，找出一条从那一个起点，可以让武士棋走完n*n格而不重复的路径-Samurai (knight) in chess and chess in the horse is taking the L-shaped route, enter a size value n looking forward to enter a starting point coordinates, to iden
EightQueen_bcb6
- (This is Borland C++Builder version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including
EightQueen_java
- (This is Java version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including Gauss, have wo
EightQueen_vb
- (This is Visual Basic 6 version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including Gaus
EightQueen_vs2008
- (This is VS2008 version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including Gauss, have