Demolition man (man destroyer) Description: The streets of the city drowned i...

VC汉诺塔游戏-能很好的演示过程-HANOR game- a really good demonstration

brew开发的基础按键信息处理对刚学的人应该有所帮助-brew button the basis of the development of information processing just learning should be helpful

ROAM动态地形LOD代码 -ROAM Dynamic Terrain LOD code

Vyger offers a D & D and Rogue-like environment in a graphical online roleplay game.

PowerFish is a class library, intended to provide a broad functionality base for any application. Although the focus is on game and demo development. PowerFish是一个类库，旨在为应用程序提供一个广泛的功能基础，虽然其重点是在游戏和演示开发。 -PowerFish is a class library, intended to provide a broad base functionality for any application. Although the focus is on ga me and demo development. PowerFish is a class library, Application procedures designed to provide a wide range of functions, and although its focus is the development and demonstration of the game.

诛先脱机代码 诛先脱机代码 诛先脱机代码 诛先脱机代码 诛先脱机代码-To punish the first off-line code to punish the first off-line code to punish the first off-line code

一个视图分割的程序,偶学了好久了-a separate procedure, even a school for a long time

迷宫程序实例-example of the maze procedure

一个swarm的小程序-a small program of swarm

贪食蛇编程要点 1、每次刷屏时需要注意无效矩形区的大小和位置，一般取整条蛇最小坐标和最大坐标组成的矩形（包括蛇的头和身体） 2、蛇全身的运行轨迹应该参照蛇头的运行轨迹 3、蛇吃下东西之后身体各点的变化情况应该参照第一点的变化，即第一点发生变化之后下一时间段第二点发生变化，再下一时间段第三点发生变化，依此类推，直到最后一点发生变化结束 4、分数的计算变量：蛇吃的一般屎数量、蛇吃大屎的数量、游戏的难度级别 计算公式：（一般屎数量＋大屎数量）＊难度级别 5、一个问题：游戏的难度设置选项框和主窗口发生数据交换采用了两种方法，发送消息法和读写外部文件法，第三种选择就是采用全局变量，但都不是太好，有没有更合适的方式保证实现该功能的同时不致使程序显得晦涩难懂不易修改和维护-Snake programming essentials 1, each scraper requires attention invalid rectangle the size and location of the smallest snakes in general to take the whole composition of coordinates and the largest rectangular coordinates (including the snake s head and body) 2, snake body running track running track should refer to the snakeheads 3, snakes eat things that all the points after the changes in the body should have a similar change in the first point, that is the first point change in the next period of time after the changes in the second point, and then the next time a change in the third point, and so on , until the end of the last poin