<?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=MineSweeper%2F%EC%9D%B4%EC%8A%B9%ED%95%9C</id>
	<title>MineSweeper/이승한 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://mediawiki.zeropage.org/index.php?action=history&amp;feed=atom&amp;title=MineSweeper%2F%EC%9D%B4%EC%8A%B9%ED%95%9C"/>
	<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=MineSweeper/%EC%9D%B4%EC%8A%B9%ED%95%9C&amp;action=history"/>
	<updated>2026-05-14T21:39:51Z</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=MineSweeper/%EC%9D%B4%EC%8A%B9%ED%95%9C&amp;diff=84664&amp;oldid=prev</id>
		<title>Maintenance script: Repair batch-0002 pages from live compare</title>
		<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=MineSweeper/%EC%9D%B4%EC%8A%B9%ED%95%9C&amp;diff=84664&amp;oldid=prev"/>
		<updated>2026-03-27T00:16:08Z</updated>

		<summary type="html">&lt;p&gt;Repair batch-0002 pages from live compare&lt;/p&gt;
&lt;a href=&quot;https://mediawiki.zeropage.org/index.php?title=MineSweeper/%EC%9D%B4%EC%8A%B9%ED%95%9C&amp;amp;diff=84664&amp;amp;oldid=34669&quot;&gt;Show changes&lt;/a&gt;</summary>
		<author><name>Maintenance script</name></author>
	</entry>
	<entry>
		<id>https://mediawiki.zeropage.org/index.php?title=MineSweeper/%EC%9D%B4%EC%8A%B9%ED%95%9C&amp;diff=34669&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=MineSweeper/%EC%9D%B4%EC%8A%B9%ED%95%9C&amp;diff=34669&amp;oldid=prev"/>
		<updated>2021-02-07T05:23:46Z</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;= Mine Sweeper/이승한 =&lt;br /&gt;
== Python ==&lt;br /&gt;
[[데블스캠프2005/화요일]] [[데블스캠프2005/Python|데블스캠프2005/python]]의 [[ToyProblem]]&lt;br /&gt;
입력 처리가 귀찮아서 안 만들었다.&lt;br /&gt;
변수값을 바꾸자.&lt;br /&gt;
 def search():&lt;br /&gt;
     for i in range(height):&lt;br /&gt;
         for j in range(width):&lt;br /&gt;
             if M[i][j]==&amp;#039;*&amp;#039;:&lt;br /&gt;
                 if M[i-1][j-1]!= &amp;#039;*&amp;#039; and i-1&amp;amp;gt;=0 and j-1&amp;amp;gt;=0 and i-1&amp;amp;lt;width and j-1&amp;amp;lt;height:&lt;br /&gt;
                     M[i-1][j-1]=M[i-1][j-1]+1&lt;br /&gt;
                 if M[i-1][j]!= &amp;#039;*&amp;#039; and i-1&amp;amp;gt;=0 and j&amp;amp;gt;=0 and i-1&amp;amp;lt;width and j&amp;amp;lt;height:&lt;br /&gt;
                     M[i-1][j]=M[i-1][j]+1&lt;br /&gt;
                 if M[i-1][j+1]!= &amp;#039;*&amp;#039; and i-1&amp;amp;gt;=0 and j+1&amp;amp;gt;=0 and i-1&amp;amp;lt;width and j+1&amp;amp;lt;height:&lt;br /&gt;
                     M[i-1][j+1]=M[i][j+1]+1&lt;br /&gt;
 &lt;br /&gt;
                 if M[i][j-1]!= &amp;#039;*&amp;#039; and i&amp;amp;gt;=0 and j-1&amp;amp;gt;=0 and i&amp;amp;lt;width and j-1&amp;amp;lt;height:&lt;br /&gt;
                     M[i][j-1]=M[i][j-1]+1&lt;br /&gt;
                 if M[i][j+1]!= &amp;#039;*&amp;#039; and i&amp;amp;gt;=0 and j+1&amp;amp;gt;=0 and i&amp;amp;lt;width and j+1&amp;amp;lt;height:&lt;br /&gt;
                     M[i][j+1]=M[i][j+1]+1&lt;br /&gt;
 &lt;br /&gt;
                 if M[i+1][j-1]!= &amp;#039;*&amp;#039; and i+1&amp;amp;gt;=0 and j-1&amp;amp;gt;=0 and i+1&amp;amp;lt;width and j-1&amp;amp;lt;height:&lt;br /&gt;
                     M[i+1][j-1]=M[i+1][j-1]+1&lt;br /&gt;
                 if M[i+1][j]!= &amp;#039;*&amp;#039; and i+1&amp;amp;gt;=0 and j&amp;amp;gt;=0 and i+1&amp;amp;lt;width and j&amp;amp;lt;height:&lt;br /&gt;
                     M[i+1][j]=M[i+1][j]+1&lt;br /&gt;
                 if M[i+1][j+1]!= &amp;#039;*&amp;#039; and i+1&amp;amp;gt;=0 and j+1&amp;amp;gt;=0 and i+1&amp;amp;lt;width and j+1&amp;amp;lt;height:&lt;br /&gt;
                     M[i+1][j+1]=M[i+1][j+1]+1&lt;br /&gt;
 &lt;br /&gt;
 width = 4&lt;br /&gt;
 height = 4&lt;br /&gt;
 M=[[&amp;#039;*&amp;#039;,&amp;#039;.&amp;#039;,&amp;#039;.&amp;#039;,&amp;#039;.&amp;#039;],[&amp;#039;.&amp;#039;,&amp;#039;.&amp;#039;,&amp;#039;.&amp;#039;,&amp;#039;.&amp;#039;],[&amp;#039;.&amp;#039;,&amp;#039;*&amp;#039;,&amp;#039;.&amp;#039;,&amp;#039;.&amp;#039;],[&amp;#039;.&amp;#039;,&amp;#039;.&amp;#039;,&amp;#039;.&amp;#039;,&amp;#039;.&amp;#039;]]&lt;br /&gt;
 &lt;br /&gt;
 for i in range(height):&lt;br /&gt;
     for j in range(width):&lt;br /&gt;
         if M[i][j]!=&amp;#039;*&amp;#039;:&lt;br /&gt;
             M[i][j]=int(0)&lt;br /&gt;
 &lt;br /&gt;
 search()&lt;br /&gt;
 &lt;br /&gt;
 for i in range(height):&lt;br /&gt;
     print M[i]&lt;br /&gt;
== FLASH ==&lt;br /&gt;
1학기였나?? 피씨실에서 지뢰찾기하다가 생각나서 짜본 소스.&lt;br /&gt;
이땐 객체가 무언지 잘 몰라서 함수와 전역 변수들만 가지고 만들어 본...-_-ㅋ;; C랑 다른건 Array 객체를 사용한 정도??;;&lt;br /&gt;
목표는 그래픽 출력까지 할려고 했는데;; 귀찮아서리~;;&lt;br /&gt;
&lt;br /&gt;
인풋 아웃풋 조건이 틀립니다. 굳이 상관없을것 같아서 올려봅니다.&lt;br /&gt;
&lt;br /&gt;
[http://zeropage.org/pub/upload/지뢰찾기.fla 소스]&lt;br /&gt;
&lt;br /&gt;
layer (전역)&lt;br /&gt;
 function set_val() {&lt;br /&gt;
 &lt;br /&gt;
 /////////////////////////지뢰의 갯수와 맵의 크기를 결정하는 변수 설정부&lt;br /&gt;
 &lt;br /&gt;
 	size = 15; 	 // 맵 사이즈 설정&lt;br /&gt;
 	quantityMine=100;// 지뢰의 갯수 설정&lt;br /&gt;
 &lt;br /&gt;
 /////////////////////////////////////////////////////////////////////////&lt;br /&gt;
 &lt;br /&gt;
 	i = j = 0;&lt;br /&gt;
 	set_all_num = 0;&lt;br /&gt;
 	//size*size 사이즈의 2중 배열의 모든 원소를 set_all_num값으로 초기화&lt;br /&gt;
 	map = new Array();&lt;br /&gt;
 	for (i=0; i&amp;amp;lt;size; i++) {&lt;br /&gt;
 		map[i] = new Array();&lt;br /&gt;
 		for (j=0; j&amp;amp;lt;size; j++) {&lt;br /&gt;
 			map[i][j] = set_all_num;&lt;br /&gt;
 		}&lt;br /&gt;
 	}&lt;br /&gt;
 	trace(&amp;quot;end set all value&amp;quot;);&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 // 지뢰의 위치를 세팅&lt;br /&gt;
 function setMine(){&lt;br /&gt;
 	mine_count = 0;&lt;br /&gt;
 	while(mine_count&amp;amp;lt;quantityMine){&lt;br /&gt;
 		for (i=0; i&amp;amp;lt;size; i++) {&lt;br /&gt;
 			for (j=0; j&amp;amp;lt;size; j++) {&lt;br /&gt;
 				if( map[i][j]!= -1 &amp;amp;amp;&amp;amp;amp; mine_count &amp;amp;lt; quantityMine &amp;amp;amp;&amp;amp;amp; !( random(100) % 5 ) ){&lt;br /&gt;
 					map[i][j]=&amp;#039;*&amp;#039;;&lt;br /&gt;
 					trace(&amp;quot;지뢰 배치 &amp;quot; + i + &amp;quot; &amp;quot; + j + &amp;quot; 지금 까지 배치된 지뢰의 갯수 : &amp;quot; + ++mine_count);&lt;br /&gt;
 				}else{&lt;br /&gt;
 &lt;br /&gt;
 				}&lt;br /&gt;
 			}&lt;br /&gt;
 		}&lt;br /&gt;
 	}&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 // 지뢰위치만을 표시한다.&lt;br /&gt;
 function showMineMap(){&lt;br /&gt;
 &lt;br /&gt;
 	trace(&amp;quot; &amp;quot;);&lt;br /&gt;
 	trace(&amp;quot; &amp;quot;);&lt;br /&gt;
 	trace(&amp;quot; &amp;quot;);&lt;br /&gt;
 &lt;br /&gt;
 	for(i=0; i&amp;amp;lt;size; i++){&lt;br /&gt;
 			temp = new Array();&lt;br /&gt;
 			temp = map[i];&lt;br /&gt;
 			showMap=temp.join(&amp;quot; &amp;quot;);&lt;br /&gt;
 			trace(showMap);&lt;br /&gt;
 	}&lt;br /&gt;
 &lt;br /&gt;
 	trace(&amp;quot; &amp;quot;);&lt;br /&gt;
 	trace(&amp;quot; &amp;quot;);&lt;br /&gt;
 	trace(&amp;quot; &amp;quot;);&lt;br /&gt;
 	&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 // 주변의 지뢰 갯수를 세고 표시한다.&lt;br /&gt;
 function checkMineMap(){&lt;br /&gt;
 	minecount = 0;&lt;br /&gt;
 	for(i=0; i&amp;amp;lt;size; i++){&lt;br /&gt;
 		for(j=0; j&amp;amp;lt;size; j++){&lt;br /&gt;
 			if(map[i][j]!=&amp;#039;*&amp;#039;){&lt;br /&gt;
 				if(map[i-1][j-1]==&amp;#039;*&amp;#039;)minecount++;&lt;br /&gt;
 				if(map[i-1][j]==&amp;#039;*&amp;#039;)minecount++;&lt;br /&gt;
 				if(map[i-1][j+1]==&amp;#039;*&amp;#039;)minecount++;&lt;br /&gt;
 				if(map[i][j-1]==&amp;#039;*&amp;#039;)minecount++;&lt;br /&gt;
 				if(map[i][j+1]==&amp;#039;*&amp;#039;)minecount++;&lt;br /&gt;
 				if(map[i+1][j-1]==&amp;#039;*&amp;#039;)minecount++;&lt;br /&gt;
 				if(map[i+1][j]==&amp;#039;*&amp;#039;)minecount++;&lt;br /&gt;
 				if(map[i+1][j+1]==&amp;#039;*&amp;#039;)minecount++;&lt;br /&gt;
 				map[i][j]=minecount;&lt;br /&gt;
 			}&lt;br /&gt;
 			minecount=0;&lt;br /&gt;
 		}&lt;br /&gt;
 	}&lt;br /&gt;
 }&lt;br /&gt;
&lt;br /&gt;
blank symbol : 플레시가 실행되면 변수를 초기화하고 함수를 부르는.&lt;br /&gt;
 onClipEvent(load){&lt;br /&gt;
 	// 변수를 모두 초기화&lt;br /&gt;
 	_root.set_val();&lt;br /&gt;
 &lt;br /&gt;
 	// 0으로 셋팅된 배열의 모든 원소를 아웃펏에 보여주는 함수&lt;br /&gt;
 	_root.showMineMap();&lt;br /&gt;
 &lt;br /&gt;
 	// 지뢰의 위치를 세팅&lt;br /&gt;
 	_root.setMine();&lt;br /&gt;
 &lt;br /&gt;
 	// 지뢰 세팅이 완료된 맵을 보여줌&lt;br /&gt;
 	_root.showMineMap();&lt;br /&gt;
 &lt;br /&gt;
 	// 주변의 지뢰 갯수를 세고 표시한다.&lt;br /&gt;
 	_root.checkMineMap();&lt;br /&gt;
 	&lt;br /&gt;
 	// 지뢰 세팅이 완료된 맵을 보여줌&lt;br /&gt;
 	_root.showMineMap();&lt;br /&gt;
 }&lt;br /&gt;
----&lt;br /&gt;
MineSweeper&lt;br /&gt;
&lt;/div&gt;</summary>
		<author><name>imported&gt;Unknown</name></author>
	</entry>
</feed>