<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://mediawiki.zeropage.org/index.php?action=history&amp;feed=atom&amp;title=EightQueenProblem%2F%EC%B5%9C%ED%83%9C%ED%98%B8%EC%86%8C%EC%8A%A4</id>
	<title>EightQueenProblem/최태호소스 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://mediawiki.zeropage.org/index.php?action=history&amp;feed=atom&amp;title=EightQueenProblem%2F%EC%B5%9C%ED%83%9C%ED%98%B8%EC%86%8C%EC%8A%A4"/>
	<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=EightQueenProblem/%EC%B5%9C%ED%83%9C%ED%98%B8%EC%86%8C%EC%8A%A4&amp;action=history"/>
	<updated>2026-05-14T21:47:28Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.39.8</generator>
	<entry>
		<id>https://mediawiki.zeropage.org/index.php?title=EightQueenProblem/%EC%B5%9C%ED%83%9C%ED%98%B8%EC%86%8C%EC%8A%A4&amp;diff=31550&amp;oldid=prev</id>
		<title>imported&gt;Unknown at 05:23, 7 February 2021</title>
		<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=EightQueenProblem/%EC%B5%9C%ED%83%9C%ED%98%B8%EC%86%8C%EC%8A%A4&amp;diff=31550&amp;oldid=prev"/>
		<updated>2021-02-07T05:23:13Z</updated>

		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;문제를 본 순간부터 시간을 체크..--;;&lt;br /&gt;
&lt;br /&gt;
누구든 코멘트해도 상관없다는..^^;;&lt;br /&gt;
&lt;br /&gt;
 //12:50&lt;br /&gt;
 //1:25&lt;br /&gt;
 # include &amp;amp;lt;stdio.h&amp;amp;gt;&lt;br /&gt;
 # include &amp;amp;lt;conio.h&amp;amp;gt;&lt;br /&gt;
 # define SIZE	8&lt;br /&gt;
 char P[SIZE][SIZE];&lt;br /&gt;
 char Q[SIZE];&lt;br /&gt;
 int c;&lt;br /&gt;
 &lt;br /&gt;
 int Check(int in)&lt;br /&gt;
 {&lt;br /&gt;
 	int re=0;&lt;br /&gt;
 	for(int i=c;i&amp;amp;gt;0;i--){&lt;br /&gt;
 		if((in-i)&amp;amp;gt;=0 &amp;amp;amp;&amp;amp;amp; P[c-i][in-i] ==1){//왼쪽으로..&lt;br /&gt;
 			return 0;&lt;br /&gt;
 		}&lt;br /&gt;
 		if( (in+i)&amp;amp;lt;SIZE &amp;amp;amp;&amp;amp;amp; P[c-i][in+i]==1 ){//오른쪽으로..&lt;br /&gt;
 			return 0;&lt;br /&gt;
 		}&lt;br /&gt;
 	}&lt;br /&gt;
 	if (i==0) return 1;&lt;br /&gt;
 	return 0;&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 int EQ()&lt;br /&gt;
 {&lt;br /&gt;
 	int re;&lt;br /&gt;
 	for(int i=0;i&amp;amp;lt;SIZE;i++){&lt;br /&gt;
 		if(Q[i]==1)	continue;// 그 줄에 queen 이있는것이므로 다음칸으로..&lt;br /&gt;
 		//없으면..그자리에 놓아서 걸리는지 체크..&lt;br /&gt;
 		if(Check(i)&amp;amp;gt;0 ){//I 에 놓을수 있을때..&lt;br /&gt;
 			Q[i]=1;&lt;br /&gt;
 			P[c][i]=1;&lt;br /&gt;
 			c++;&lt;br /&gt;
 			if(c==SIZE){//이때는 찾은 것임..&lt;br /&gt;
 				return 1;&lt;br /&gt;
 			}&lt;br /&gt;
 			re=EQ();&lt;br /&gt;
 			if (re==1) return 1;&lt;br /&gt;
 			c--;&lt;br /&gt;
 			Q[i]=0;&lt;br /&gt;
 			P[c][i]=0;&lt;br /&gt;
 &lt;br /&gt;
 		}&lt;br /&gt;
 &lt;br /&gt;
 	}&lt;br /&gt;
 	return 0;&lt;br /&gt;
 &lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 void Init()&lt;br /&gt;
 {&lt;br /&gt;
 	for (int i=0;i&amp;amp;lt;SIZE;i++){&lt;br /&gt;
 		for(int j=0;j&amp;amp;lt;SIZE;j++) P[i][j]=0;&lt;br /&gt;
 		Q[i]=0;&lt;br /&gt;
 	}&lt;br /&gt;
 	c=0;&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 void RESULT()&lt;br /&gt;
 {&lt;br /&gt;
 	for(int i=0;i&amp;amp;lt;SIZE;i++){&lt;br /&gt;
 		for(int j=0;j&amp;amp;lt;SIZE;j++)printf(&amp;quot;%d &amp;quot;,P[i][j]);&lt;br /&gt;
 		printf(&amp;quot;\n&amp;quot;);&lt;br /&gt;
 	}&lt;br /&gt;
 }&lt;br /&gt;
 void main(void)&lt;br /&gt;
 {&lt;br /&gt;
 	Init();&lt;br /&gt;
 	EQ();&lt;br /&gt;
 	RESULT();&lt;br /&gt;
 	getch();&lt;br /&gt;
 	return;&lt;br /&gt;
 }&lt;br /&gt;
&lt;br /&gt;
아래것은 두번째 문제인데..&lt;br /&gt;
EQ() 함수에서 return 1 하는 대신 계속 풀도록 하고..&lt;br /&gt;
마지막에 도착했을때만 결과를 출력하도록 수정하였다.&lt;br /&gt;
그리고 메인함수에서 결과 출력하는 루틴은 제거 하였다.&lt;br /&gt;
&lt;br /&gt;
 //12:50&lt;br /&gt;
 //1:25&lt;br /&gt;
 # include &amp;amp;lt;stdio.h&amp;amp;gt;&lt;br /&gt;
 # include &amp;amp;lt;conio.h&amp;amp;gt;&lt;br /&gt;
 # define SIZE	8&lt;br /&gt;
 char P[SIZE][SIZE];&lt;br /&gt;
 char Q[SIZE];&lt;br /&gt;
 int c;&lt;br /&gt;
 &lt;br /&gt;
 void RESULT()&lt;br /&gt;
 {&lt;br /&gt;
 	static int count=0;&lt;br /&gt;
 	count++;&lt;br /&gt;
 	printf(&amp;quot;solv %d\n&amp;quot;,count);&lt;br /&gt;
 	for(int i=0;i&amp;amp;lt;SIZE;i++){&lt;br /&gt;
 		for(int j=0;j&amp;amp;lt;SIZE;j++)printf(&amp;quot;%d &amp;quot;,P[i][j]);&lt;br /&gt;
 		printf(&amp;quot;\n&amp;quot;);&lt;br /&gt;
 	}&lt;br /&gt;
 	printf(&amp;quot;\n&amp;quot;);&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 int Check(int in)&lt;br /&gt;
 {&lt;br /&gt;
 	int re=0;&lt;br /&gt;
 	for(int i=c;i&amp;amp;gt;0;i--){&lt;br /&gt;
 		if((in-i)&amp;amp;gt;=0 &amp;amp;amp;&amp;amp;amp; P[c-i][in-i] ==1){//왼쪽으로..&lt;br /&gt;
 			return 0;&lt;br /&gt;
 		}&lt;br /&gt;
 		if( (in+i)&amp;amp;lt;SIZE &amp;amp;amp;&amp;amp;amp; P[c-i][in+i]==1 ){//오른쪽으로..&lt;br /&gt;
 			return 0;&lt;br /&gt;
 		}&lt;br /&gt;
 	}&lt;br /&gt;
 	if (i==0) return 1;&lt;br /&gt;
 	return 0;&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 int EQ()&lt;br /&gt;
 {&lt;br /&gt;
 	int re;&lt;br /&gt;
 	for(int i=0;i&amp;amp;lt;SIZE;i++){&lt;br /&gt;
 		if(Q[i]==1)	continue;// 그 줄에 queen 이있는것이므로 다음칸으로..&lt;br /&gt;
 		//없으면..그자리에 놓아서 걸리는지 체크..&lt;br /&gt;
 		if(Check(i)&amp;amp;gt;0 ){//I 에 놓을수 있을때..&lt;br /&gt;
 			Q[i]=1;&lt;br /&gt;
 			P[c][i]=1;&lt;br /&gt;
 			c++;&lt;br /&gt;
 			if(c==SIZE){//이때는 찾은 것임..&lt;br /&gt;
 //				return 1;&lt;br /&gt;
 				RESULT();&lt;br /&gt;
 			}&lt;br /&gt;
 			re=EQ();&lt;br /&gt;
 //			if (re==1) return 1;&lt;br /&gt;
 			c--;&lt;br /&gt;
 			Q[i]=0;&lt;br /&gt;
 			P[c][i]=0;&lt;br /&gt;
 &lt;br /&gt;
 		}&lt;br /&gt;
 &lt;br /&gt;
 	}&lt;br /&gt;
 	return 0;&lt;br /&gt;
 &lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 void Init()&lt;br /&gt;
 {&lt;br /&gt;
 	for (int i=0;i&amp;amp;lt;SIZE;i++){&lt;br /&gt;
 		for(int j=0;j&amp;amp;lt;SIZE;j++) P[i][j]=0;&lt;br /&gt;
 		Q[i]=0;&lt;br /&gt;
 	}&lt;br /&gt;
 	c=0;&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 void main(void)&lt;br /&gt;
 {&lt;br /&gt;
 	Init();&lt;br /&gt;
 	EQ();&lt;br /&gt;
 //	RESULT();&lt;br /&gt;
 	getch();&lt;br /&gt;
 	return;&lt;br /&gt;
 }&lt;br /&gt;
&lt;/div&gt;</summary>
		<author><name>imported&gt;Unknown</name></author>
	</entry>
</feed>