搜索资源列表
zhuigan
- 追赶法，可以求解三对角 矩阵，非常可靠，经过本人多次验证-chasing method can solve three-diagonal matrix, very reliable, after I repeatedly verified
N-queen
- 求解n皇后问题。给定一个N×N的棋盘，在棋盘上放置N个皇后，使得N个皇后两两之间互不攻击。任何两个处于同一列，同一行，同一对角线上的皇后都会互相攻击。 -Solve the n queens problem. To set a NN board, place N queens on a chessboard, making the N-queens do not attack each other between every two. Any two in the same column,
ProjectPT
- The program reads n-size matrix from text file, Finds the upper diagonal matrix. Finds the sum of the elements for each column and finds the maximum of each column. In this project explained opening and cloding text files.-The program reads n-size ma
Console1
- project files for tri-diagonal matrix
mayz
- this a simple mase game. in this 0 is road and 1 is wall. and the mouse can not move in diagonal road. if we enter a matrix of 0 and 1 with diagonal roads the program will be crashed or not respond if we enter a correct matrix the program will be pri
SIZIQI-FRENCH-VER
- 法语版四子棋，7*6格式，上下或者对角线有四个棋子相连即为胜利。分为双人对战，人机对战，机机对战三种模式，使用剪枝算法。-60/5000 French version of the four-board, 7* 6 format, up and down or diagonal four pieces connected to the victory. Divided into two pairs of war, man-machine war, machine battle three m