搞不懂这个源码是什么

类似于俄罗斯方块、但绝对比它好得多的游戏程序。只要掌握规则，尽可向自己的大脑挑战！不过，这可是要上瘾的！ -something like russian dice,but better than it.you can challenge your brain,after mastering its rules.pay attention not to addict to it.

国外游戏开发者杂志2001年第一期配套代码，包含Jeff Lander的计算一个物体的vertex weights的代码--Code of game development magazine in 2001 first issue, it including Jeff Lander`s vertexweights code of computating a object

CroftSoft Code Library是一个开源的可移植的纯Java游戏库，提供了样例游戏，基于Swing的脚本动画引擎，部署框架，防火墙通道联网包，以及工具类。-CroftSoft Code Library is an open source of transplants for pure Java games, the sample games, the script based on Swing animation engine, deployment framework, firewall access networking kits, and tools category.

编写的贪吃蛇游戏程序-prepared by the Snake Games

3D游戏编程――01（DIRECTX9.0）

小小游戏专业源代码-small professional game source code

BlackJack -Player vs Computer- -BlackJack-Player vs Computer-

　　贪吃蛇的ＴＣ游戏程序源代码，我们用了一个学期在高级Ｃ语言课了组队完成的．-Greedy Snake,a game with TC language.It takes us one semester to finish it in C language course.

国外游戏开发者杂志2002年第八期配套代码，包含了Jon Blow的打包和开包的算法代码--Code of game development magazine in 2002 eighth issue, including algorithm code of Jon Blow`s packing and opening packet

贪食蛇编程要点 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