Location:
Search - chessboard.b
Search list
Description: 独立钻石棋问题描述： 有一棋盘， 上有44个钻石棋子，有一位置空缺， 棋盘初始状态如下： １１１ １１１ １１１ １１１１１１１１１ １１１１０１１１１ １１１１１１１１１ １１１ １１１ １１１ 其中，0表示没有放置棋子， 1表示放置。 规定走法如下： a. 任一棋子可越过一相邻棋子（紧相邻）跳到一空缺位置， 并吃掉越过的棋子（从棋盘移处） 如， 走一步后棋盘状态： １１１ １１１ １１１ １１１１１１１１１ １１１１１００１１ １１１１１１１１１ １１１ １１１ １１１ b. 最后只留下一个棋子在棋盘上， 并且位置在正中央。 要求： 用程序得出正确走法。 输入： 无 输出： 每一步移动后的棋盘状态， 格式如上。-independent diamond chess Problem description : a chessboard, there are 44 pieces of diamonds, a position vacant chessboard initial state as follows : 111111111 111101111 111111111 which, 0 no place pawn, a place said. Provisions in law are as follows : a. as a pawn to be crossed an adjacent piece (bear adjacent) jumped to a vacant position, and eaten across the pawn (shift from the chessboard) If, after the chessboard go one step further state : 111111111 111111111 111110011 111111111 111111111 b. leaving only a game son on the chessboard, and in the middle position. Requirements : getting the correct procedures in law. Input : None output : each step of the chessboard mobile state, the format above.
Platform: |
Size: 6878 |
Author: 欧 |
Hits:
Description: 由n2个方块排成n行n列的正方形称为“n元棋盘”。如果两个皇后位于n元棋盘上的同一行或同一列或同一对角线上，则称它们为互相攻击。要求输出使n无棋盘上的n个皇后互不攻击的所有布局。 具体要求如下； (1)n可由键盘输入。 (2)在输入n后，动态建立方法说明中所需要建立的数组空间；程序运行结束时释放该存储空间。 (3)分别用n＝4，5，6运行你的程序。-by n2-n squares formed n trip out of a square called "n chessboard." If the two Queen's n chessboard at the same line or in the same series or on the same diagonal, claimed they attack each other. Request output enable chessboard n-n the Queen's not attack each other all the layout. Specific requirements are as follows; (1) n input from the keyboard. (2) n input, dynamic methodology established by the needs of an array of space; Running at the end of the release of the storage space. (3), respectively, n = 4,5,6 run your procedures.
Platform: |
Size: 8992 |
Author: 林新华 |
Hits:
Description: 11 中国象棋打谱软件 主类 Chess 对弈棋盘ChessBoard 棋子ChessPiece 棋点 ChessPoint 走棋法则Rule 步骤MoveStep 记录棋谱MakeChessManual 棋谱演示Demon 12 魔板游戏 主类PuzzleFrame 魔板PuzzlePad 魔板中的点SquarePoint 13 挖雷游戏 主类Game 方块 Block 雷区 MineSquare 雷标数目 FindAroundMineMarkNumber 雷标判断 DetermineMineMarkIsRightOrWrong 成片挖开区域 DetermineDigArea 无雷连通区 FindSafeArea 随机布雷 RandomSetMine 周围地雷个数FindAroundMineNumber 显示剩余雷数CountMine 计时器TimeCount 英雄榜录入对话框Record 显示英雄榜对话框ShowRecord 挖雷成功DecideWinner 14 网络聊天室 (B/S模式) 客户端主类ClientChat 客户端输入妮称界面InputNameTextField 客户端聊天界面ChatArea 服务器端主类ChatServer 15 局域网络广播系统 客户端主类Receive 服务器端主类BroadCastWord
Platform: |
Size: 41086 |
Author: kuraxkillua@163.com |
Hits:
Description: 独立钻石棋问题描述： 有一棋盘， 上有44个钻石棋子，有一位置空缺， 棋盘初始状态如下： １１１ １１１ １１１ １１１１１１１１１ １１１１０１１１１ １１１１１１１１１ １１１ １１１ １１１ 其中，0表示没有放置棋子， 1表示放置。 规定走法如下： a. 任一棋子可越过一相邻棋子（紧相邻）跳到一空缺位置， 并吃掉越过的棋子（从棋盘移处） 如， 走一步后棋盘状态： １１１ １１１ １１１ １１１１１１１１１ １１１１１００１１ １１１１１１１１１ １１１ １１１ １１１ b. 最后只留下一个棋子在棋盘上， 并且位置在正中央。 要求： 用程序得出正确走法。 输入： 无 输出： 每一步移动后的棋盘状态， 格式如上。-independent diamond chess Problem description : a chessboard, there are 44 pieces of diamonds, a position vacant chessboard initial state as follows : 111111111 111101111 111111111 which, 0 no place pawn, a place said. Provisions in law are as follows : a. as a pawn to be crossed an adjacent piece (bear adjacent) jumped to a vacant position, and eaten across the pawn (shift from the chessboard) If, after the chessboard go one step further state : 111111111 111111111 111110011 111111111 111111111 b. leaving only a game son on the chessboard, and in the middle position. Requirements : getting the correct procedures in law. Input : None output : each step of the chessboard mobile state, the format above.
Platform: |
Size: 6144 |
Author: 欧 |
Hits:
Description: 由n2个方块排成n行n列的正方形称为“n元棋盘”。如果两个皇后位于n元棋盘上的同一行或同一列或同一对角线上，则称它们为互相攻击。要求输出使n无棋盘上的n个皇后互不攻击的所有布局。 具体要求如下； (1)n可由键盘输入。 (2)在输入n后，动态建立方法说明中所需要建立的数组空间；程序运行结束时释放该存储空间。 (3)分别用n＝4，5，6运行你的程序。-by n2-n squares formed n trip out of a square called "n chessboard." If the two Queen's n chessboard at the same line or in the same series or on the same diagonal, claimed they attack each other. Request output enable chessboard n-n the Queen's not attack each other all the layout. Specific requirements are as follows; (1) n input from the keyboard. (2) n input, dynamic methodology established by the needs of an array of space; Running at the end of the release of the storage space. (3), respectively, n = 4,5,6 run your procedures.
Platform: |
Size: 9216 |
Author: 林新华 |
Hits:
Description: 设B是一个n×n棋盘，n=2k,(k=1,2,3,…)。用分治法设计一个算法，使得：用若干个L型条块可以覆盖住B的除一个特殊方格外的所有方格。其中，一个L型条块可以覆盖3个方格。且任意两个L型条块不能重叠覆盖棋盘-Set B is an n × n chessboard, n = 2k, (k = 1,2,3, ...). With sub-rule method to design an algorithm so that: The number of L-type compartmentalization can live B coverage in addition to a special side of all the extra box. Among them, an L-bar may be covered by three grid. And any two L-bar can not be overlapping coverage chessboard
Platform: |
Size: 236544 |
Author: 陈馨 |
Hits:
Description: 还行,看了下觉得不错就弄上来了哈哈,大家一下-Also line, read the next feel good get up on a ha ha, like everyone
Platform: |
Size: 5346304 |
Author: 周志 |
Hits:
Description: n皇后问题求解(8<=n<=1000)
a) 皇后个数的设定
在指定文本框内输入皇后个数即可,注意: 皇后个数在8和1000 之间(包括8和1000)
b) 求解
点击<Solve>按钮即可进行求解.
c) 求解过程显示
在标有Total Collision的静态文本框中将输出当前棋盘上的皇后总冲突数.
当冲突数降到0时,求解完毕.
d) 求解结果显示
程序可以图形化显示8<=n<=50的皇后求解结果.
e) 退出程序,点击<Exit>即可退出程序.-n Queens Problem Solving (8 <= n <= 1000) a) Queen number of settings in the designated text box to enter the Queen s Number, Note: Queen s number in between 8 and 1000 (including 8 and 1000) b) Solving <Solve> Click button to solve. c) the solution process displayed in the Total Collision marked the static text box will output the current Queen s chessboard the total number of conflicts. When the conflict reduced the number of 0:00, finished solving. d) The results showed that the procedure can solve the graphical display 8 <= n <= 50 to solve the results of the Queen. e) withdraw from the program, click <Exit> to withdraw from the program.
Platform: |
Size: 128000 |
Author: jiangtao |
Hits:
Description: 可供两人对弈的黑白棋游戏（Othello）:
(a) 8×8棋盘，共64格；
(b) 共64个棋子，每个棋子都黑白各一面；
(c) 开局时，为棋盘中央放置4颗棋，黑白各半，交叉排列，如下图；
(d) 开局者持黑子，为先手，之后双方方轮流下棋。
(e) 下子位置必须能够夹击对方的棋子；
(f) 当己方的一子与最后下的一子呈一直线(橫、直、斜，8个方向)，且中间包夹到对方的
棋子，则中间被包夹的棋子将变为己方颜色。
(g) 若一方无处可下子，则由对方下。双方皆无子可下时，棋局结束。
(h) 棋局结束时，棋盘上较多子的一方为胜。-Game for two games of Reversi (Othello): (a) 8 × 8 chessboard, a total of 64 cells (b) a total of 64 chess pieces, each side of the chess pieces are black and white (c) start when the central board placed 4 game, were equally divided between black and white, cross-array, as illustrated (d) persons who start sunspots for the upper hand, followed by the two sides take turns to play chess. (e) Now position must be able to attack the opponent
Platform: |
Size: 1974272 |
Author: leo |
Hits:
Description: 课程设计：
1.求出在一个n×n的棋盘上，放置n个不能互相捕捉的国际象棋“皇后”的所有布局。
2.设计一个利用哈夫曼算法的编码和译码系统，重复地显示并处理以下项目，直到选择退出为止。
【基本要求】
1) 将权值数据存放在数据文件(文件名为data.txt，位于执行程序的当前目录中)
2) 分别采用动态和静态存储结构
3) 初始化：键盘输入字符集大小n、n个字符和n个权值，建立哈夫曼树；
4) 编码：利用建好的哈夫曼树生成哈夫曼编码；
5) 输出编码；
6) 设字符集及频度如下表：
字符 空格 A B C D E F G H I J K L M
频度 186 64 13 22 32 103 21 15 47 57 1 5 32 20
字符 N O P Q R S T U V W X Y Z
频度 57 63 15 1 48 51 80 23 8 18 1 16 1
-Curriculum design:
1. Obtained in an n × n chessboard, the place to catch each other should not n个chess "Queen" of all the layout.
2. The design of a use of Huffman coding and decoding algorithms systems, and deal with duplicate to show the following items until the exit date selection.
The basic requirements 【】
1) will be the right value data stored in data files (file named data.txt, located in the implementation of procedures in the current directory)
2), respectively, dynamic and static storage structure
3) Initialization: keyboard input character set size of n, n and n characters of the right value, set up Huffman tree
4) Coding: Using the built Huffman tree generated Huffman coding
5) output coding
6) The character set and the frequency of the following table:
Space characters A B C D E F G H I J K L M
Frequency of 186 64 13 22 32 103 21 15 47 57 1 5 32 20
Character N O P Q R S T U V W X Y Z
Frequency 57 63 15 1 48 51 80 23 8 18 1 16 1
Platform: |
Size: 550912 |
Author: 赵刚 |
Hits:
Description: 五子棋模拟。以数字0表示空棋盘，以其他数字表示以下的棋子的位置，以A，B表示两个游戏者，游戏者可以通过输入棋子坐标指明落子位置，若干步后，程序会判断游戏结果并输出。-Gobang simulation. To the number 0 indicates an empty chessboard, with other numbers indicate the location of the following pieces, to A, B, said two players, players can enter the coordinates specified in Lazi pawn position, a number of steps, the program will judge whether the game results and output.
Platform: |
Size: 18432 |
Author: wtl |
Hits:
Description: 1、由于对算法不是太了解，电脑下棋部分只是简单的输出在一个点上。
2、之前没碰过C++，第一次使用C++编程，使得里面的架构设计不是太合理。
编程步骤：
a、先画出一个棋盘；
b、在管理者组织下，两个人之间可以对战（自己判断输赢）；
c、有裁判判断输赢；
d、加上电脑玩家；-1, because of the algorithm is not very understanding, computer chess simply part of the output at one point. 2, did not come across before C++, the first use of C++ programming, making the inside of the structure design is not too reasonable. Programming steps: a, first draw a chessboard b, organized by the managers, between two people can play against (winning or losing their own judgments) c, a referee to determine winning or losing d, with the computer players
Platform: |
Size: 515072 |
Author: li |
Hits:
Description: 残缺棋盘问题中利用分而治之的方法，将覆盖2k×2k残缺棋盘的问题转化为覆盖较小残缺棋盘的问题。2k×2k棋盘一个很自然的划分方法就是将它划分为如图1a所示的4个2k-1×2k-1棋盘。当完成这种划分后，4个小棋盘中仅仅有一个棋盘存在残缺方格（因为原来的2k×2k棋盘仅仅有一个残缺方格）。首先用三格板填充中心处把剩下的3个小棋盘转变为残缺棋盘，如图1b所示，其中原2k×2k棋盘中的残缺方格落入左上角的2k-1×2k-1棋盘，分割填充后产生四个小的残缺棋盘，然后，任务转变为分别填充四个小的2k-1×2k-1残缺棋盘，之后可以将每个2k-1×2k-1分别再进行划分。-Board of incomplete problem to divide and rule method, will cover 2 k x 2 k incomplete board into smaller the problem of incomplete board. 2 k x 2 k board a natural division method is divided into as shown in figure 1 a shows the four 2 k-1 x 2 k-1 board. When finished this classification, four small board only have a chessboard exist incomplete squares (because of the original 2 k x 2 k board has only a damaged box). First with three case board at the center of the filling the rest of the three small board into incomplete board, as shown in figure 1 b shows, including the original 2 k x 2 k board of incomplete fall into the top left corner of the box 2 k-1 x 2 k-1 board, divided the generation after filling the incomplete four small board, then, the task into four small were filled with 2 k-1 x 2 k-1 incomplete board, after every 2 k-can be 1 x 2 k-1 respectively to divide again.
Platform: |
Size: 15360 |
Author: 李记 |
Hits:
Description: 在一个 （k≥0）个方格组成的棋盘中，恰有一个方格与其他方格不同，称该方格为特殊方格。显然，特殊方格在棋盘中可能出现的位置有 种，因而有4k种不同的棋盘，图a所示是k=2时16种棋盘中的一个。棋盘覆盖问题（chess cover problem）要求用图 (b)所示的4种不同形状的L型骨牌覆盖给定棋盘上除特殊方格以外的所有方格，且任何2个L型骨牌不得重叠覆盖。-In a (k = 0) squares which board, just a different box and other boxes, saying that the square is special box. Obviously, the possible special box on the board position in kind, so there are 4K different board, shown in figure a is k=2 16 board in a. Board covering problem (chess cover problem) requirements for graph (b) of 4 different shapes of L type domino coverage shown in box at all except in special box outside the given on the board, and any of the 2 L type domino coverage may not overlap.
Platform: |
Size: 1024 |
Author: 程瑶 |
Hits: