Life is filled with wonder

統計

隨筆 - 3
文章 - 0
評論 - 2
引用 - 0

常用鏈接

留言簿(1)

隨筆分類

隨筆檔案

相冊

程序

學習

搜索

閱讀排行榜

評論排行榜

置頂隨筆 #

[置頂]八皇后

寫了兩天,
應用遞歸和回溯.
對如何組織類,
更一步加深
/Files/xyq002444/Queens.rar
八皇后主程序的算法

import java.util.*;

public class QueenSolver {

private int count; //皇后的數目

private Queen queens[];

private Queue<Queen[]> queue;

public QueenSolver(int count) {

this.count = count;

queens = new Queen[count];

queue = new QueenList<Queen[]>();

this.initialize();

this.process();

}

//初始化

private void initialize() {

for (int i = 0; i < count; i++) {

queens[i] = new Queen(i + 1, 0);

}

//能否放置一個皇后

private boolean place(Queen queen) {

for (int i = 0; i < queen.x - 1; i++) {

if (queens[i].y == queen.y || queens[i].getX_Y() == queen.getX_Y() || queens[i].getAddXY() == queen.getAddXY()) {

return false;

}

return true;

}

private void process() {

int k = 1;

queens[k - 1].y = 0;

while (k > 0) {

queens[k - 1].y = queens[k - 1].y + 1;

while (queens[k - 1].y <= count && !this.place(queens[k - 1])) {

queens[k - 1].y = queens[k - 1].y + 1;

}

if (queens[k - 1].y <= count) {

if (k == count) {

// this.printPosition(queens);

Queen[] queenClone = new Queen[queens.length];

for (int i = 0; i < queenClone.length; i++) {

queenClone[i] = new Queen(queens[i].x, queens[i].y);

}

for (int i = 0; i < queens.length; i++) {

queens[i].setXPosition();

queens[i].setYPosition();

}

queue.offer(queenClone);

} else {

k = k + 1;

queens[k - 1].y = 0;

}

} else {

k = k - 1;

}

public void printPosition(Queen[] queens) {

for (Queen queen : queens) {

System.out.println(queen.x + " y: " + queen.y);

}

public Queue<Queen[]> getQueue() {

return this.queue;

}

posted @ 2007-12-14 21:14 小屁閱讀(824) | 評論 (2) | 編輯收藏

僅列出標題