<?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%EA%B9%80%ED%95%B4%EC%B2%9C</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%EA%B9%80%ED%95%B4%EC%B2%9C"/>
	<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=EightQueenProblem/%EA%B9%80%ED%95%B4%EC%B2%9C&amp;action=history"/>
	<updated>2026-05-15T23:41:47Z</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/%EA%B9%80%ED%95%B4%EC%B2%9C&amp;diff=31515&amp;oldid=prev</id>
		<title>imported&gt;idea0073: {CREATE}</title>
		<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=EightQueenProblem/%EA%B9%80%ED%95%B4%EC%B2%9C&amp;diff=31515&amp;oldid=prev"/>
		<updated>2016-03-12T15:29:12Z</updated>

		<summary type="html">&lt;p&gt;{CREATE}&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt; #START_TIME_ 16.03.12 PM 11:27&lt;br /&gt;
 #lan : Python 3.5.1&lt;br /&gt;
  &lt;br /&gt;
 Map = [[0]*8 for x in range(8)]&lt;br /&gt;
 &lt;br /&gt;
 no = 0&lt;br /&gt;
 &lt;br /&gt;
 def printMap():&lt;br /&gt;
     global no&lt;br /&gt;
     no += 1&lt;br /&gt;
     print(&amp;#039;NO.&amp;#039;,no)&lt;br /&gt;
     global Map&lt;br /&gt;
     for x in range(8):&lt;br /&gt;
         for y in range(8):&lt;br /&gt;
             a = {0:&amp;#039;-&amp;#039;, 1:&amp;#039;Q&amp;#039;}&lt;br /&gt;
             print(a[Map[x][y]], end=&amp;#039; &amp;#039;)&lt;br /&gt;
         print(&amp;#039;&amp;#039;)&lt;br /&gt;
     return&lt;br /&gt;
 &lt;br /&gt;
 def is_queen_there_check(floor, point):&lt;br /&gt;
     global Map&lt;br /&gt;
     a, b = floor, point&lt;br /&gt;
 &lt;br /&gt;
     col = [ Map[x][b] for x in range(8)] # 세로&lt;br /&gt;
     if 0 &amp;amp;lt; sum(col): return&lt;br /&gt;
 &lt;br /&gt;
     ang = [ Map[a-x][b-x] for x in range(min(b+1,a+1)) ] #왼대각&lt;br /&gt;
     if 0 &amp;amp;lt; sum(ang): return&lt;br /&gt;
 &lt;br /&gt;
     ang = [ Map[a-x][b+x] for x in range(min(8-b,a+1)) ] #오른대각&lt;br /&gt;
     if 0 &amp;amp;lt; sum(ang): return&lt;br /&gt;
 &lt;br /&gt;
     if a+1 == 8:&lt;br /&gt;
         Map[a][b] = 1&lt;br /&gt;
         printMap() #8층이면 인쇄&lt;br /&gt;
         Map[a][b] = 0&lt;br /&gt;
         return&lt;br /&gt;
 &lt;br /&gt;
     Map[a][b] = 1&lt;br /&gt;
     for x in range(8):&lt;br /&gt;
         is_queen_there_check(a+1,x) #그냥 돌려라.&lt;br /&gt;
     Map[a][b] = 0&lt;br /&gt;
     &lt;br /&gt;
 for x in range(8):&lt;br /&gt;
     is_queen_there_check(0,x)&lt;br /&gt;
 &lt;br /&gt;
 #Error1 : INF_LOOP PM 11:46, All Reset #코드 작성 다시 시작&lt;br /&gt;
 #Error2 : 같은 거 8번 인쇄, PM 12:05&lt;br /&gt;
 #Error3 : 467개? PM 12:13&lt;br /&gt;
 &lt;br /&gt;
 #92개 체크 완료&lt;br /&gt;
 #END TIME : 16.03.13 PM 12:15&lt;br /&gt;
정말 많이 공부해야겠다.&lt;br /&gt;
52 lines, 주석 다 날리면 42 lines 인데 무슨 상관이야!&lt;br /&gt;
&lt;br /&gt;
가장 눈에 들어오는 문제점이라면, 수치 착각, 반복문의 범위.&lt;br /&gt;
&lt;/div&gt;</summary>
		<author><name>imported&gt;idea0073</name></author>
	</entry>
</feed>