搜索资源列表
200538162048732
- 棋盘覆盖,有关C++的辕马程序,望各位指教-chessboard coverage, the C Shaft-horse procedures, hope you enlighten
qipanwenti
- 棋盘覆盖问题: 1.是8X8的棋盘 2.能动态的演示 -chessboard coverage : 1. Yes 8x8 chessboard 2. Dynamic Demonstration
wudaoqi
- 要求是用Ｃ语言编一个五道棋的程序，用鼠标走棋．并且能数棋盘上的棋子，能判断胜负.-request with C language is a series of five chess program that will move the mouse away. And can a few pieces on a chessboard to be able to judge the outcome.
hourse
- 算法的基本思路是： 定义结构体：struct PLACE{int x, int y}表示棋盘上的位置。 依题意，马每跳一步之后都可以从七个不同的方向选择下一步的跳马，当然，前提是跳的这一步在棋盘内且它前面的任何一步都没跳到这一格子上（限界），就可以认为这一步跳成功，否则跳马不成功。若跳马不成功，则找下一个方向尝试跳马，若七个方向都跳马不成功，则回溯。 -algorithm for the basic ideas : the structure definition : PLAC
AlgorithmCode
- 海明码 出站入站序列 非递归生成树 九格填质数 七子控棋盘等等算法-Haiming yards out station stops recursive sequence-9 grid spanning tree fill several seven-quality control algorithm chessboard, etc.
5ivb_118537
- 残缺棋盘的覆盖问题的一个残缺棋盘的覆盖问题严格解决的办法-chessboard incomplete coverage of a chessboard incomplete coverage of the strict solution
host2
- 马踏棋盘算法编程，实现在棋盘上任意两点间的最短路径求解。-horse riding chessboard programming algorithm to achieve on the chessboard arbitrary 2:00 of finding the shortest path.
DrawChess
- 属GDI编程,在窗口央中画一个象棋盘,窗口大小变的话,棋盘跟着变并成比例占满窗口-is GDI programming, the window Authorities were painting a chess set, change the window size, and chessboard with variable proportion earned window
TicTac(vc)
- 用vc++.net实现的一个棋盘类小游戏，适合vc++初学者。-with vc. Net realized a chessboard-like games for vc beginners.
netwarchess
- 主要函数介绍： Init1() 程序启动时加载初始化 Init() 重新布棋初始化 Image0MouseDown 点到主棋盘空白处进行判断是否可以在此处布棋 Image1MouseDown 点到自方棋子记录原始的oldID、oldX、oldY的值 Image26MouseDown 点到对面棋进行判断 Image101MouseDown 点到副棋盘空白处进行判断是否可以在此处放棋 -main function presentations : Init1 () comm
PropSheet_Test
- 胜负判定条件 如果玩家在棋盘上没有地方可以下子，则该玩家对手可以连下。双方都没有棋子可以下时棋局结束，以棋子数目来计算胜负，棋子多的一方获胜。 在棋盘还没有下满时，如果一方的棋子已经被对方吃光，则棋局也结束。将对手棋子吃光的一方获胜。-determine the outcome if the terms players on the chessboard no place Now, the players can rival even the next. Both c
mataqipan
- 马踏棋盘的贪心算法，8*8棋盘，基本上不用回溯。-horse riding chessboard of the greedy algorithm, 8 * 8 chessboard, basically not retroactive.
knignt
- 求解骑士游历问题的程序。骑士游历问题是在8X8格的国际象棋棋盘上随意放置一个马，按照马走“日”字的规则对马进行操作，问是否能够不重复的走遍棋盘的每个格。-Cavaliers traveled problem solving process. Cleveland traveled problem is the 8x8 grid of international chess pieces on dumped a horse, according to Ma take "days"
qpfg
- 残缺棋盘覆盖问题的VC源代码及完整的实验报告-chessboard incomplete coverage of the VC source code and complete experimental report
chest
- java编写的可调节棋盘大小的残缺棋盘覆盖演示程序-prepared by the board may adjust the size of incomplete coverage chessboard Demonstration Program
chessofhorse
- 数据结构课程设计：一个国际象棋的马蹋遍棋盘的演示程序-data structure course design : an international chess Ma H times chessboard of the demonstration program
chesscover
- 此程序是关于算法设计与分析中的棋盘覆盖问题，采用分治策略实现的。-on algorithm design and analysis covering the chessboard, using the divide and conquer strategy to achieve.
TTQ
- 跳子棋程序的实现不算太难，但却也有一点复杂。主要原因可能就是它的棋盘为一个不规则的图形。思路是：把棋盘121棋格分为7个区，中间为0区，上为1区，逆时针至右上角。-jump-game procedure is not hard to achieve, but they are a bit complicated. It is probably mainly due to a chessboard irregular graphics. Ideas : 121 chess board put gr
8queenc
- 1） 【八皇后问题】设在初始状态下在国际象棋棋盘上没有任何棋子(皇后)。然后顺序在第1行，第2行，…。第8行上布放棋子。在每一行中有8个可选择位置，但在任一时刻，棋盘的合法布局都必须满足3个限制条件，即任何两个棋子不得放在棋盘上的同一行、或者同一列、或者同一斜线上。试编写一个递归算法，求解并输出此问题的所有合法布局。-1) [8 Queen's problems -- in the initial state in the international chess pieces on no
hm7
- Applet画面中绘制一个19×19的围棋棋盘 在Applet画面中绘制一个19×19的围棋棋盘。棋盘的颜色由白（white）、灰(gray)、橘黄(orange)、浅红(pink)几种颜色中随机选取。-Applet picture drawing a 19 x 19 Go Applet chessboard in drawing a picture 000 19 x 19 Go chessboard. Calculations by the color white (white), gr