Android_主角移动与地图平滑滚动

俄罗斯方块.本程序包含最基本设计框架,可以实现消格子(Tetris eluosfangkuai)

　在数独高手的规则是要将9个数字填入一个9个小九宫格组成的9×9格子里。使得每一行，每一列和每个小九宫格里都有1－9的数字，并且每个数字在它所在的行、列以及每个小九宫格里面都只出现唯一一次。(Sudoku expert in the rules is to fill a 9 digit composed of nine small squares 9 × 9 grid yard. So that each row, each column and each have 1-9 small squares in the figures, and each figure in its row, column, and each small squares appear only inside the only time.)

说明：  贪吃蛇游戏的Java文件，class文件和讲解，他能增长，吃食物，碰到石头会死亡。(The Code and Explanation of Snake Eating)

实现连连看游戏的算法。采用递归的算法找实现，很参考价值。(Achieve Lianliankan game algorithms. Find a recursive algorithm implementation, it is reference value.)

赛车游戏 基于vc++的游戏设计 实现赛车游戏(car games)

c语言版本中国象棋，完美实现经典象棋的c语言程序源代码。(c language version of Chinese chess, the perfect realization of the classic chess c language program source code.)

推箱子小游戏，visualC++经典游戏设计(Sokoban game, visualC++ Classic Game Design)

Background Given a set of rectangles {R1, R2, …, Rn}, compute the area of their common intersection. i.e., Area(R1∩R2∩…∩Rn) The edges of the rectangles R1, R2, …, Rn, are either vertical or horizontal lines. For example, the intersection of 4 rectangles, R1, R2, R3, and R4, in the following figure is the shaded rectangle. Input The input contains (N + 1) lines. The first line specifies the number of rectangles N, where 1 < N < 1000. Since the sides of the rectangles are parallel to the x-axis and y-axis, each rectangle is bounded by the lines x = x1, x = x2, y = y1 and y = y2 and each subsequent line of the input file thus specifies one rectangle in the following format: x1 x2 y1 y2 such that 0 <= x1 < x2 <= 10000 and 0 <= y1 < y2 <= 10000, and x1, x2, y1 and y2 are integers. Output The output file contains the area of the intersection of all the rectangles.

数独程式原代码,对学习数独编程很有帮助!(few independent program source code, to learn a number of useful programming alone!)

此文档为visual c++平台实现俄罗斯方块的部分参考代码。已经通过调试通过。(This document is visual c++ platform Tetris part reference code. Has passed through debugging.)