https://mediawiki.zeropage.org/index.php?action=history&feed=atom&title=EightQueenProblem%2F%ED%96%87%EB%B3%91%EC%95%84%EB%A6%AC 2026-05-15T01:56:02Z Revision history for this page on the wiki MediaWiki 1.39.8 https://mediawiki.zeropage.org/index.php?title=EightQueenProblem/%ED%96%87%EB%B3%91%EC%95%84%EB%A6%AC&diff=31551&oldid=prev 2021-02-07T05:23:12Z

<p></p> <p><b>New page</b></p><div>초보티가 묻어나는 소스코드;<br /> <br /> 모든 경우의 수에 대해 공격여부 조사 --;<br /> <br /> char board[8][8] = {<br /> {1, 0, 0, 0, 0, 0, 0, 0},<br /> {1, 0, 0, 0, 0, 0, 0, 0},<br /> {1, 0, 0, 0, 0, 0, 0, 0},<br /> {1, 0, 0, 0, 0, 0, 0, 0},<br /> {1, 0, 0, 0, 0, 0, 0, 0},<br /> {1, 0, 0, 0, 0, 0, 0, 0},<br /> {1, 0, 0, 0, 0, 0, 0, 0},<br /> {1, 0, 0, 0, 0, 0, 0, 0}<br /> };<br /> char queens[8] = { 0, 0, 0, 0, 0, 0, 0, 0 };<br /> <br /> void increase()<br /> {<br /> register int i, j;<br /> <br /> i = 7;<br /> for (i = 7; i &amp;gt;= 0; i--) {<br /> j = queens[i];<br /> board[i][j] = 0;<br /> j = queens[i] = (j + 1) % 8;<br /> board[i][j] = 1;<br /> if (j)<br /> break;<br /> }<br /> }<br /> <br /> int check_line()<br /> {<br /> register int i, j;<br /> register int count;<br /> <br /> for (i = 0; i &amp;lt; 8; i++) {<br /> for (count = 0, j = 0; j &amp;lt; 8; j++) {<br /> if (board[j][i]) {<br /> if (count)<br /> return 1;<br /> count = 1;<br /> }<br /> }<br /> if (! count)<br /> return 1;<br /> }<br /> return 0;<br /> }<br /> <br /> int check_diagonal()<br /> {<br /> register int count;<br /> register int i, j, k;<br /> <br /> for (i = 0, j = 0; j &amp;lt;= 6; j++) {<br /> for (count = 0, k = 0; k &amp;lt; 8-j; k++) {<br /> if (board[i+k][j+k]) {<br /> if (count)<br /> return 1;<br /> count = 1;<br /> }<br /> }<br /> }<br /> for (i = 1, j = 0; i &amp;lt;= 6; i++) {<br /> for (count = 0, k = 0; k &amp;lt; 8-i; k++) {<br /> if (board[i+k][j+k]) {<br /> if (count)<br /> return 1;<br /> count = 1;<br /> }<br /> }<br /> }<br /> for (i = 0, j = 1; j &amp;lt;= 7; j++) {<br /> for (count = 0, k = 0; k &amp;lt; j+1; k++) {<br /> if (board[i+k][j-k]) {<br /> if (count)<br /> return 1;<br /> count = 1;<br /> }<br /> }<br /> }<br /> for (i = 1, j = 7; i &amp;lt;= 6; i++) {<br /> for (count = 0, k = 0; k &amp;lt; 8-i; k++) {<br /> if (board[i+k][j-k]) {<br /> if (count)<br /> return 1;<br /> count = 1;<br /> }<br /> }<br /> }<br /> return 0;<br /> }<br /> <br /> int main()<br /> {<br /> int i, j;<br /> <br /> for (;; increase()) {<br /> if (check_line())<br /> continue;<br /> else if (check_diagonal())<br /> continue;<br /> break;<br /> }<br /> <br /> for (i = 0; i &amp;lt; 8; i++) {<br /> for (j = 0; j &amp;lt; 8; j++) {<br /> printf(&quot;%d &quot;, board[i][j]);<br /> }<br /> printf(&quot;\n&quot;);<br /> }<br /> <br /> return 0;<br /> }<br /> </div>

imported>Unknown