18 Wheels game sources. Operational system: DOS. Compiles OK in Quickbasic.

此版本的华容道仅是个VC++语言的演示版，只是为了演示 一种思路，所以没有增加任何的功能。本游戏图象也是从 同类FLASH游戏中剪出，可惜它的出处网页已经不可访问了. 由于华容道每角色同一时刻可能有不同方向的选择，增加了 判断难度。本游戏主要演示单键无选择控制华容道的模拟 智能处理过程。当然这很简单，谈不上真正的智能。 如果对AI类兴趣的话，可以到 http://chess.withu.com 和计算机下一盘，欢迎交流探讨该类AI算法。 本游戏还存在一些BUG，就请各位自己修正了。 (是在边界处理上，少处理了一种特殊情况) 另：本游戏开放源码，可以随意使用或修改。 ------ musix@withu.com , 2001 , taizhou,jiangsu-HuaRong Road is only the VC language version of the demonstration, only to demonstrate an idea, no increase in functionality. The game image is similar FLASH from the game, cut out, but it"s not the source website has been visited. As HuaRong Road every role the same time may be different and the choice of direction, increasing the difficulty of judging. The main demonstration of a single-game non-selective control of HuaRong Road intelligent simulation process. Of course, this is very simple, no real intelligence. If the AI category of interest, to be the next http://chess.withu.com and computer disk welcome such exchange on

迷宫探险算法，一个CPP文件实现。在TC下编译生成。生成的程序是dos exe。LEFT/UP/RIGHT/DOWN 在迷宫中向左、上、右、下走一步。走过的路线显示为黄色，回头路显示为红色。-Adventure maze algorithm to achieve a CPP file. TC compiled in the next generation. Procedure is generated dos exe. LEFT/UP/RIGHT/DOWN in the maze to the left, on right, step down. Through the line shown as yellow, red back.

通讯录格式转换的源码，可以切入到相关项目中进行使用。-Format conversion of the source address book, you can cut to the use of related projects.

对心电信号的QRS波进行前期处理，主要是下载信号和对信号去噪滤波。-Of the QRS wave of ECG to pre-treatment, mainly to download signals and to signal de-noising filter.

潜艇大战 经典游戏原码-World War II submarine game classic original code

vc++OpenGL显示中文的源程序，把中文变成位图来显示-vc++ OpenGL display Chinese source, the Chinese into a bitmap to display the

总个数确定后，每张盘curDisk的移动方向maybe_To是确定的且唯一的：如共有三个盘时，盘1始终向左移动。 这里，将柱子由左向右看成A(源柱子Source),B(借助的柱子Borrow),C(目标柱子Target). A的左看成C，B的左看成A，C的左看成B； A的有看成B，B的右看成C，C的右看成A； 每张盘的移动方法(因为不可能连续两次移动相同的盘！)： 一个盘curDisk现在在 柱子curStick上，那么curDisk另一个柱子(3个中除了2个的另1个) 只要有选择的选择一个柱子curStick,分析、判断其最上面的盘curDisk的能否向curDisk确定的唯一的方向移动；移动 完后 再 选择 另一个 柱子 分析 判断 就可以完成了 (这个算法特别适合于人玩这个“弱智”（我有同学这么说）游戏，我玩我的文曲星pc1000a上的Hanoi 9层游戏，需要5分钟就可以移动完毕)-total number identified, each set curDisk maybe_To direction of the movement of which is determined only : If there are three disk, was always left a mobile. Here, the columns from left to right as A (source pole Source), B (using the pole Borrow), C (target pole Target). A left as C, B to the left as A, C on the left as B; A as the B, B on the right side as C, the right as A; each set of mobile methods (as it is impossible for the same two mobile disk!) : a set curDisk curStick now on the pole, then curDisk another pole (three in addition to two other one), when given a choice, choose a pole

Description Calculate a+b Input Two integer a,b (0

C++笔试题目，对于找工作的人相信很有帮助的-C++ Written test subject to find a job for the people believe that useful

HomePlug1.0以及HomePlug AV标准白皮书-HomePlug1.0 as well as the HomePlug AV standard white paper