▍1. shoujixiangqi
说明: 象棋手机游戏部分源码 象棋手机游戏部分源码(Chess mobile phone game chess game part of part of source code)
说明: 象棋手机游戏部分源码 象棋手机游戏部分源码(Chess mobile phone game chess game part of part of source code)
说明: 俄罗斯方块 实现三个部分:图形,变形和主程序。图形部分设计八个主要的图形用于将来的产生。变形主要设计实现各种图形的变换以及快速向下。主程序实现所需的各种初始化以及在运行过程中的音乐,分数变化等等。 (Russian box to achieve three parts: graphics, deformation and the main program. Eight major graphics design graphics for future generation. Deformation of the major design change to achieve a variety of graphics, as well as rapid downward. Required to achieve the main program to initialize and run in the process of music, scores of changes and so on.)
一个用Visal C++编写的俄罗斯方块小程序。(A used Visal C++ Prepared Tetris applet.)
C+++Weekend+Crash+Course这是一个中国象棋的原代码(C+++ Weekend+ Crash+ Course This is a Chinese chess original code)
VB版纸牌源码(VB source code version of Solitaire)
一款完全基于C++的五子棋源程序,其采用“半开半闭区间”独特写法。(Based entirely on a C++ The Gobang source, and its use of )
五子棋小程序,实现双人对抗,能完成悔棋,复盘,等基本功能。在玩棋时,能自动判禁手以及判赢。(Gobang small procedures, to achieve double confrontation, to complete悔棋, rehabilitation sites, such as basic features. Playing chess, they can automatically cut the hands and sub-contractors to win.)
java游戏原码,中国象棋(java source games, Chinese chess)
一个五子棋的源文件,另外还有设计程序的基本思路和玩法(Gobang a source file, as well as the design process of the basic thinking and playing)
连连看的源代码,好东西啊,很好的东西啊,大家下啊(Lianliankan the source code, a good thing, ah, ah good things, everyone under the ah)
C++ Builder开发的四川麻将.具有商业游戏的风格.(C++ Builder developed by Sichuan mahjong. With commercial game style.)
用socket 编写的够击.自定义了网络传输的规约,和发牌规则.(Socket prepared with enough hit. Since the definition of the network transmission of the Statute, and licensing rules.)
连连看.net代码。最新更新的,VS2005开发。(Lianliankan. Net code. The latest update, VS2005 development.)
C++Builder程序设计范例:中国象棋 / 胡达著 出版发行 北京 : 清华大学出版社, 2002 的附带光盘,用c++Builder实现一个简单的象棋程序 (C++ Builder Program Design Example: Chinese Chess/Huda published a Beijing: Tsinghua University Press, 2002 spin-off CD-ROM, with c++ Builder realize a simple chess program)
曾经做过的课程设计,比较简单的翻牌游戏,考察简单C语言的掌握(Has done curriculum design, relatively simple flop games, study simple C language)
残缺棋盘问题的VC++实现,用分而治之方法解决此问题(Defective chessboard problem VC++ Realize, using divide and conquer method to solve this problem)
这是C++编写的围棋打谱程序,读取SGF棋谱文件格式,欢迎围棋爱好人士使用。(This is the C++ Prepared to fight Go spectrum procedures, read chess SGF file formats are welcome to Go-loving users.)
在一个8×8国际象棋盘上,有8个皇后,每个皇后占一格;要求皇后间不会出现相互"攻击"的现象,即不能有两个皇后处在同一行、同一列或同一对角线上。问共有多少种不同的方法。 本算法采用一维数组来进行处理。数组的下标i表示棋盘上的第i列,a[i]的值表示皇后在第i列所放的位置。如:a[1]=5,表示在棋盘的第一例的第五行放一个皇后。(8 × 8 in a chess set, there s eight, each accounting for a Queen s grid request will not be any mutual between Queen s attack phenomenon, that can not have two Queen s in the same line, the same row or the same diagonal. Asked the total number of different ways. This algorithm uses one-dimensional array to be processed. Array subscript i said i chessboard first out, a [i] value that s in the first place i listed by location. Such as: a [1] = 5, said the first cases in the chessboard of the fifth line of a Queen s release.)