第1次实验——NPC问题(回溯算法、聚类分析)

public class EightQueen {
	private int index = 1;
	private final int SCALE = 8;
	private int[] answer = new int[SCALE];
	private void initArray() {
		for (int i = 0; i < answer.length; i++) {
			answer[i] = -1;
			}
		}
	private boolean canStay(int row, int col) {
		// 判断是否在同一列 && 斜率的绝对值为1
		for (int i = 0; i < row; i++) {
			if (answer[i] == col
					|| Math.abs(row - i) == Math.abs(col - answer[i])) {
				return false;
				}
			}
		return true;
		}
	private void calculate() {
		for (int row = 0; row < SCALE; row++) {
			if (answer[row] == -1) {
				answer[row] = 0;
			}
			for (int col = answer[row]; col <= SCALE; col++) {
				if (col == SCALE) {
					answer[row] = -1;
					row--;
					if (row < 0) {
						return;
					}
					col = answer[row];
					continue;
				}
				// 若(row, col)能放置皇后
				if (canStay(row, col)) {
					answer[row] = col;
					// 八皇后已填满，则输出信息
					if (row == SCALE - 1) {
						showMsg();
						continue;
						}
					break;
					}
				}
			}
		}
	private void showMsg() {
		System.out.println("第" + index + "种方案：-----------------------------------");
		for (int i = 0; i < answer.length; i++) {
			for (int j = 0; j < SCALE; j++) {
				if (answer[i] == j) {
					System.out.print("Q ");
					} else {
					System.out.print("X ");
					}
				}
			System.out.println("");
			}
		System.out.println("\n");		
		index++;
		}	
	public EightQueen() {
		initArray();
		calculate();
		}
	public static void main(String[] args) {
		EightQueen eightQueen = new EightQueen();
		}
	}

2.学生聚类分析思考

　学生大概可以分为四类，分别为“积极主动型”、“学霸型”、“游戏人生型”、“迷茫无目标型”。

　首先本次通过几个变量来对学生进行分类：1.明确目标 2.课余学习时间 3.课余玩游戏时间　4.学习效率