https://mediawiki.zeropage.org/index.php?action=history&feed=atom&title=EightQueenProblem%2F%EC%A1%B0%ED%98%84%ED%83%9C2
EightQueenProblem/조현태2 - Revision history
2026-05-15T07:34:50Z
Revision history for this page on the wiki
MediaWiki 1.39.8
https://mediawiki.zeropage.org/index.php?title=EightQueenProblem/%EC%A1%B0%ED%98%84%ED%83%9C2&diff=31547&oldid=prev
imported>Unknown at 05:23, 7 February 2021
2021-02-07T05:23:12Z
<p></p>
<p><b>New page</b></p><div>이번엔 정상적인 해결..ㅎㅎ<br />
여전히 잠이 안오는 걸로봐서.. 데블스캠프가 밤낮을 바꾼듯..;;ㅁ;;<br />
#include &lt;iostream&gt;<br />
using namespace std;<br />
int main(){<br />
char mark[8][8]={0,};<br />
int x[8]={0,};<br />
int qeen=0;<br />
while(qeen!=8){<br />
if (0==mark[x[qeen]][qeen])<br />
{<br />
for (register int i=-7; i&lt;8; ++i)<br />
{<br />
if (-1&lt;i)<br />
mark[x[qeen]][i]=1;//가로<br />
if (-1&lt;x[qeen]+i &amp;&amp; x[qeen]+i&lt;8 &amp;&amp; -1&lt;qeen+i &amp;&amp; qeen+i&lt;8)<br />
mark[x[qeen]+i][qeen+i]=1;//대각선<br />
if (-1&lt;x[qeen]+i &amp;&amp; x[qeen]+i&lt;8 &amp;&amp; -1&lt;qeen-i &amp;&amp; qeen-i&lt;8)<br />
mark[x[qeen]+i][qeen-i]=1;//대각선<br />
}<br />
mark[x[qeen]][qeen]=2;<br />
++qeen;<br />
if (8==qeen)<br />
{<br />
//출력하고 종료한다.<br />
for (register int i=0; i&lt;8; ++i){<br />
for (register int j=0; j&lt;8; ++j){<br />
if (2==mark[i][j])<br />
cout &lt;&lt; "■";<br />
else<br />
cout &lt;&lt; "□";<br />
}<br />
cout &lt;&lt; "\n";<br />
}<br />
system("PAUSE");<br />
break;<br />
}<br />
}<br />
else<br />
{<br />
++x[qeen];<br />
if (8==x[qeen])<br />
{<br />
while (8==x[qeen])<br />
{<br />
x[qeen]=0;<br />
qeen--;<br />
if(-1==qeen)<br />
{<br />
cout &lt;&lt; "검색에 실패하였습니다.";<br />
return 0;<br />
}<br />
++x[qeen];<br />
}<br />
for(register int i=0; i&lt;8; ++i)<br />
for(register int j=0; j&lt;8; ++j)<br />
mark[i][j]=0;<br />
qeen=0;<br />
}<br />
}<br />
}<br />
return 0;<br />
}<br />
<br />
----<br />
[[EightQueenProblem]] [[EightQueenProblem/조현태]]<br />
</div>
imported>Unknown