Eight Queen Problem/nextream

8queen.html (javascript) ¶

�� C/C++ �� 파��, C�� 할�� 하�� 하�� 크��트�� .

�� 2�� 크해 �� 하�� 호�� 하�� . �� (0,0) �� 하�� , ��히�� 한�� 한�� .

�� 해��, 한�� , �� 하�� 하��, �� 했��, ��한 �� .

�� 한 �� 행해 �� X��표�� 해 ��협�� 해�� 한 �� 행하��, �� 하�� . ��협�� 해�� , �� X, Y ��표�� 합�� 한 �� 하�� .

~cpp 
<script>
var positions = [0,0,0,0,0,0,0,0];
function display() {
    for (var i=0; i<8; i++) document.write(positions[i] + " ");
    document.write("<br>");
}
function safe(line) {
    for (var i=0; i<line; i++)
        if (positions[line]==positions[i] || i+positions[i]==line+positions[line] || i-positions[i]==line-positions[line])
            return false;
    return true;
}
function check(line) {
    if (line>=8) { display(); return; }
    for (var i=0; i<8; i++) {
        positions[line] = i;
        if (safe(line)) check(line+1);
    }
}
check(1);
</script>

�� 확��하�� display �� 해��. --1002

~cpp 
<script> 
var positions = [0,0,0,0,0,0,0,0]; 

function printBefore(position) {
    for (var j=0; j<position; j++)
        document.write("X"); 
}
function printAfter(position) {
    for (var j=position+1;j<8; j++)
        document.write("X");
}

function display() { 
    for (var i=0; i<8; i++) {
        printBefore(positions[i]);
        document.write("O");
        printAfter(positions[i]);
        document.write("<br>");
    }
    document.write("<br>"); 
} 
function safe(line) { 
    for (var i=0; i<line; i++) 
        if (positions[line]==positions[i] || i+positions[i]==line+positions[line] || i-positions[i]==line-positions[line]) 
            return false; 
    return true; 
} 
function check(line) { 
    if (line>=8) { display(); return; } 
    for (var i=0; i<8; i++) { 
        positions[line] = i; 
        if (safe(line)) check(line+1); 
    } 
} 
check(1); 
</script>

EightQueenProblem