파이썬 프로젝트) 콘솔형 지뢰찾기 만들기
2017. 8. 7. 21:22ㆍ프로그래밍(주력)/PYTHON
이 단기 프로젝트를 하게 된 계기는 소수전공 마지막 프로젝트를 위해서였다.
우선 지뢰찾기의 순서를 생각해 보았다.
1. 맵 크기에 맞는 맵 생성, 랜덤 지뢰 좌표 저장(이 코드에서는 9x9맵에서 지뢰 10개
이부분은 아주아주 간단히 리스트 생성, 랜덤함수 생성으로 구현하였다.
def makemap():
global box
global mine
box = []
check = 0
mine = []
#지뢰 10개를 랜덤으로 만듦
for i in range(999):
same = False
x = random.randrange(0,box_num-1)
y = random.randrange(0,box_num-1)
#중복 처리
for j in range(i-1):
if mine[j][0] == x and mine[j][1] == y:
same = True
break
if same:
continue
elif not same:
mine.append([x,y])
check += 1
if check == 10:
break
#먼저 필드에 지뢰를 배치
for i in range(box_num):
temp = []
for j in range(box_num):
cm = False
for a in range(10):
if mine[a][0] == i and mine[a][1] == j:
cm = True
if cm:
temp.append(9)
else:
temp.append(0)
box.append(temp)
#minecheck함수를 사용해 지뢰 갯수 표시
for i in range(box_num):
for j in range(box_num):
if box[i][j] == 0:
box[i][j] = minecheck(i,j);
2. 주변 8칸의 지뢰 갯수 구하기
맵의 가장자리 부분은 조사해야 하는 범위가 변동되므로 모두 조건문으로 처리(단순무식)
#주위의 지뢰 찾는 함수
def minecheck(i,j):
global box
c = 0
if i == 0 and j == 0:
if box[1][0] == 9:
c += 1
if box[0][1] == 9:
c += 1
if box[1][1] == 9:
c += 1
elif i == 0 and j == box_num-1:
if box[1][box_num-1] == 9:
c += 1
if box[0][box_num-2] == 9:
c += 1
if box[1][box_num-2] == 9:
c += 1
elif i == box_num-1 and j == box_num-1:
if box[box_num-2][box_num-1] == 9:
c += 1
if box[box_num-2][box_num-2] == 9:
c += 1
if box[box_num-1][box_num-2] == 9:
c += 1
elif i == box_num-1 and j == 0:
if box[box_num-2][1] == 9:
c += 1
if box[box_num-1][1] == 9:
c += 1
if box[box_num-2][0] == 9:
c += 1
elif i == 0:
if box[1][j] == 9:
c += 1
if box[0][j+1] == 9:
c += 1
if box[0][j-1] == 9:
c += 1
if box[1][j+1] == 9:
c += 1
if box[1][j-1] == 9:
c += 1
elif j == 0:
if box[i][1] == 9:
c += 1
if box[i-1][0] == 9:
c += 1
if box[i+1][0] == 9:
c += 1
if box[i+1][1] == 9:
c += 1
if box[i-1][1] == 9:
c += 1
elif i == box_num-1:
if box[box_num-2][j] == 9:
c += 1
if box[box_num-1][j+1] == 9:
c += 1
if box[box_num-1][j-1] == 9:
c += 1
if box[box_num-2][j+1] == 9:
c += 1
if box[box_num-2][j-1] == 9:
c += 1
elif j == box_num-1:
if box[i][box_num-2] == 9:
c += 1
if box[i-1][box_num-1] == 9:
c += 1
if box[i+1][box_num-1] == 9:
c += 1
if box[i+1][box_num-2] == 9:
c += 1
if box[i-1][box_num-2] == 9:
c += 1
else:
if box[i-1][j+1] == 9:
c += 1
if box[i][j+1] == 9:
c += 1
if box[i+1][j+1] == 9:
c += 1
if box[i-1][j] == 9:
c += 1
if box[i+1][j] == 9:
c += 1
if box[i-1][j-1] == 9:
c += 1
if box[i][j-1] == 9:
c += 1
if box[i+1][j-1] == 9:
c += 1
return c
3. 클릭 시 가려진 네모를 없애기
이것은 해답 맵과 보여지는 맵 각각 리스트로 구현해 2개를 번갈아 조사하며 구현하였다.
4. 지뢰 체크 기능 구현
또한 보여지는 리스트 조정으로 구현
5. 공백 클릭시(주변 8칸에 지뢰가 없는 칸 클릭 시) 숫자 칸까지 퍼져나가 블럭이 사라지는 기능
재귀함수를 사용하여 8칸 지뢰 검사와 같은 원리로 구현함
#재귀함수를 사용한 공백 지우기
def blank_break(i, j):
if box_show[i][j] == 1 :
box_show[i][j] = 0
if i == 0 and j == 0:
if box[1][0] == 0:
blank_break(1, 0)
else:
box_show[1][0] = 0
if box[0][1] == 0:
blank_break(0, 1)
else:
box_show[0][1] = 0
if box[1][1] == 0:
blank_break(1, 1)
else:
box_show[1][1] = 0
elif i == 0 and j == box_num - 1:
if box[1][box_num - 1] == 0:
blank_break(1, box_num - 1)
else:
box_show[1][box_num - 1] = 0
if box[0][box_num - 2] == 0:
blank_break(0, box_num - 2)
else:
box_show[0][box_num - 2] = 0
if box[1][box_num - 2] == 0:
blank_break(1, box_num - 2)
else:
box_show[1][box_num - 2] = 0
elif i == box_num-1 and j == box_num-1:
if box[box_num - 2][box_num - 1] == 0:
blank_break(box_num - 2, box_num - 1)
else:
box_show[box_num - 2][box_num - 1] = 0
if box[box_num - 1][box_num - 2] == 0:
blank_break(box_num - 1, box_num - 2)
else:
box_show[box_num - 1][box_num - 2] = 0
if box[box_num - 2][box_num - 2] == 0:
blank_break(box_num - 2, box_num - 2)
else:
box_show[box_num - 2][box_num - 2] = 0
elif i == box_num-1 and j == 0:
if box[box_num - 1][1] == 0:
blank_break(box_num - 1, 1)
else:
box_show[box_num - 1][1] = 0
if box[box_num - 2][0] == 0:
blank_break(box_num - 2, 0)
else:
box_show[box_num - 2][0] = 0
if box[box_num - 2][1] == 0:
blank_break(box_num - 2, 1)
else:
box_show[box_num - 2][1] = 0
elif i == 0:
if box[0][j - 1] == 0:
blank_break(0, j - 1)
else:
box_show[0][j - 1] = 0
if box[0][j + 1] == 0:
blank_break(0, j + 1)
else:
box_show[0][j + 1] = 0
if box[1][j-1] == 0:
blank_break(1, j-1)
else:
box_show[1][j-1] = 0
if box[1][j] == 0:
blank_break(1, j)
else:
box_show[1][j] = 0
if box[1][j+1] == 0:
blank_break(1, j+1)
else:
box_show[1][j+1] = 0
elif j == 0:
if box[i - 1][0] == 0:
blank_break(i - 1, 0)
else:
box_show[i - 1][0] = 0
if box[i + 1][0] == 0:
blank_break(i + 1, 0)
else:
box_show[i + 1][0] = 0
if box[i-1][1] == 0:
blank_break(i-1, 1)
else:
box_show[i-1][1] = 0
if box[i][1] == 0:
blank_break(i, 1)
else:
box_show[i][1] = 0
if box[i+1][1] == 0:
blank_break(i+1, 1)
else:
box_show[i+1][1] = 0
elif i == box_num - 1:
if box[box_num - 1][j - 1] == 0:
blank_break(box_num - 1, j - 1)
else:
box_show[box_num - 1][j - 1] = 0
if box[box_num - 1][j + 1] == 0:
blank_break(box_num - 1, j + 1)
else:
box_show[box_num - 1][j + 1] = 0
if box[box_num - 2][j-1] == 0:
blank_break(box_num - 2, j-1)
else:
box_show[box_num - 2][j-1] = 0
if box[box_num - 2][j] == 0:
blank_break(box_num - 2, j)
else:
box_show[box_num - 2][j] = 0
if box[box_num - 2][j+1] == 0:
blank_break(box_num - 2, j+1)
else:
box_show[box_num - 2][j+1] = 0
elif j == box_num-1:
if box[i - 1][box_num - 1] == 0:
blank_break(i - 1, box_num - 1)
else:
box_show[i - 1][box_num - 1] = 0
if box[i + 1][box_num - 1] == 0:
blank_break(i + 1, box_num - 1)
else:
box_show[i + 1][box_num - 1] = 0
if box[i-1][box_num - 2] == 0:
blank_break(i-1, box_num - 2)
else:
box_show[i-1][box_num - 2] = 0
if box[i][box_num - 2] == 0:
blank_break(i, box_num - 2)
else:
box_show[i][box_num - 2] = 0
if box[i+1][box_num - 2] == 0:
blank_break(i+1, box_num - 2)
else:
box_show[i+1][box_num - 2] = 0
else:
if box[i - 1][j] == 0:
blank_break(i - 1, j)
else:
box_show[i - 1][j] = 0
if box[i - 1][j-1] == 0:
blank_break(i - 1, j-1)
else:
box_show[i - 1][j-1] = 0
if box[i - 1][j+1] == 0:
blank_break(i - 1, j+1)
else:
box_show[i - 1][j+1] = 0
if box[i][j - 1] == 0:
blank_break(i, j - 1)
else:
box_show[i][j - 1] = 0
if box[i][j+1] == 0:
blank_break(i, j+1)
else:
box_show[i][j+1] = 0
if box[i+1][j + 1] == 0:
blank_break(i+1, j + 1)
else:
box_show[i+1][j + 1] = 0
if box[i+1][j] == 0:
blank_break(i+1, j)
else:
box_show[i+1][j] = 0
if box[i+1][j - 1] == 0:
blank_break(i+1, j - 1)
else:
box_show[i+1][j - 1] = 0
return
총정리 코드 :
import random
global box_num,box,mine
box_num = 9
box = []
mine = []
box_show = []
#보여주는 리스트 초기화
for i in range(box_num):
temp = []
for j in range(box_num):
temp.append(1)
box_show.append(temp)
def box_print():
print(" 1 2 3 4 5 6 7 8 9")
for i in range(box_num):
a = "" + str(i+1)
for j in range(box_num):
if (box_show[i][j] == 1):
a += " ☐"
elif (box_show[i][j] == 2):
a += " ⦿"
else:
if box[i][j] == 9:
a += " ■"
elif box[i][j] == 0:
a += " "
else:
a += " "+str(box[i][j])
print(a)
print()
#디버그용 출력
def Print():
for i in range(box_num):
a = ""
for j in range(box_num):
if (box[i][j] == 9):
a += " ■"
else:
a += " "+str(box[i][j])
print(a)
print()
#주위의 지뢰 찾는 함수
def minecheck(i,j):
global box
c = 0
if i == 0 and j == 0:
if box[1][0] == 9:
c += 1
if box[0][1] == 9:
c += 1
if box[1][1] == 9:
c += 1
elif i == 0 and j == box_num-1:
if box[1][box_num-1] == 9:
c += 1
if box[0][box_num-2] == 9:
c += 1
if box[1][box_num-2] == 9:
c += 1
elif i == box_num-1 and j == box_num-1:
if box[box_num-2][box_num-1] == 9:
c += 1
if box[box_num-2][box_num-2] == 9:
c += 1
if box[box_num-1][box_num-2] == 9:
c += 1
elif i == box_num-1 and j == 0:
if box[box_num-2][1] == 9:
c += 1
if box[box_num-1][1] == 9:
c += 1
if box[box_num-2][0] == 9:
c += 1
elif i == 0:
if box[1][j] == 9:
c += 1
if box[0][j+1] == 9:
c += 1
if box[0][j-1] == 9:
c += 1
if box[1][j+1] == 9:
c += 1
if box[1][j-1] == 9:
c += 1
elif j == 0:
if box[i][1] == 9:
c += 1
if box[i-1][0] == 9:
c += 1
if box[i+1][0] == 9:
c += 1
if box[i+1][1] == 9:
c += 1
if box[i-1][1] == 9:
c += 1
elif i == box_num-1:
if box[box_num-2][j] == 9:
c += 1
if box[box_num-1][j+1] == 9:
c += 1
if box[box_num-1][j-1] == 9:
c += 1
if box[box_num-2][j+1] == 9:
c += 1
if box[box_num-2][j-1] == 9:
c += 1
elif j == box_num-1:
if box[i][box_num-2] == 9:
c += 1
if box[i-1][box_num-1] == 9:
c += 1
if box[i+1][box_num-1] == 9:
c += 1
if box[i+1][box_num-2] == 9:
c += 1
if box[i-1][box_num-2] == 9:
c += 1
else:
if box[i-1][j+1] == 9:
c += 1
if box[i][j+1] == 9:
c += 1
if box[i+1][j+1] == 9:
c += 1
if box[i-1][j] == 9:
c += 1
if box[i+1][j] == 9:
c += 1
if box[i-1][j-1] == 9:
c += 1
if box[i][j-1] == 9:
c += 1
if box[i+1][j-1] == 9:
c += 1
return c
def makemap():
global box
global mine
box = []
check = 0
mine = []
#지뢰 10개를 랜덤으로 만듦
for i in range(999):
same = False
x = random.randrange(0,box_num-1)
y = random.randrange(0,box_num-1)
#중복 처리
for j in range(i-1):
if mine[j][0] == x and mine[j][1] == y:
same = True
break
if same:
continue
elif not same:
mine.append([x,y])
check += 1
if check == 10:
break
#먼저 필드에 지뢰를 배치
for i in range(box_num):
temp = []
for j in range(box_num):
cm = False
for a in range(10):
if mine[a][0] == i and mine[a][1] == j:
cm = True
if cm:
temp.append(9)
else:
temp.append(0)
box.append(temp)
#minecheck함수를 사용해 지뢰 갯수 표시
for i in range(box_num):
for j in range(box_num):
if box[i][j] == 0:
box[i][j] = minecheck(i,j);
#재귀함수를 사용한 공백 지우기
def blank_break(i, j):
if box_show[i][j] == 1 :
box_show[i][j] = 0
if i == 0 and j == 0:
if box[1][0] == 0:
blank_break(1, 0)
else:
box_show[1][0] = 0
if box[0][1] == 0:
blank_break(0, 1)
else:
box_show[0][1] = 0
if box[1][1] == 0:
blank_break(1, 1)
else:
box_show[1][1] = 0
elif i == 0 and j == box_num - 1:
if box[1][box_num - 1] == 0:
blank_break(1, box_num - 1)
else:
box_show[1][box_num - 1] = 0
if box[0][box_num - 2] == 0:
blank_break(0, box_num - 2)
else:
box_show[0][box_num - 2] = 0
if box[1][box_num - 2] == 0:
blank_break(1, box_num - 2)
else:
box_show[1][box_num - 2] = 0
elif i == box_num-1 and j == box_num-1:
if box[box_num - 2][box_num - 1] == 0:
blank_break(box_num - 2, box_num - 1)
else:
box_show[box_num - 2][box_num - 1] = 0
if box[box_num - 1][box_num - 2] == 0:
blank_break(box_num - 1, box_num - 2)
else:
box_show[box_num - 1][box_num - 2] = 0
if box[box_num - 2][box_num - 2] == 0:
blank_break(box_num - 2, box_num - 2)
else:
box_show[box_num - 2][box_num - 2] = 0
elif i == box_num-1 and j == 0:
if box[box_num - 1][1] == 0:
blank_break(box_num - 1, 1)
else:
box_show[box_num - 1][1] = 0
if box[box_num - 2][0] == 0:
blank_break(box_num - 2, 0)
else:
box_show[box_num - 2][0] = 0
if box[box_num - 2][1] == 0:
blank_break(box_num - 2, 1)
else:
box_show[box_num - 2][1] = 0
elif i == 0:
if box[0][j - 1] == 0:
blank_break(0, j - 1)
else:
box_show[0][j - 1] = 0
if box[0][j + 1] == 0:
blank_break(0, j + 1)
else:
box_show[0][j + 1] = 0
if box[1][j-1] == 0:
blank_break(1, j-1)
else:
box_show[1][j-1] = 0
if box[1][j] == 0:
blank_break(1, j)
else:
box_show[1][j] = 0
if box[1][j+1] == 0:
blank_break(1, j+1)
else:
box_show[1][j+1] = 0
elif j == 0:
if box[i - 1][0] == 0:
blank_break(i - 1, 0)
else:
box_show[i - 1][0] = 0
if box[i + 1][0] == 0:
blank_break(i + 1, 0)
else:
box_show[i + 1][0] = 0
if box[i-1][1] == 0:
blank_break(i-1, 1)
else:
box_show[i-1][1] = 0
if box[i][1] == 0:
blank_break(i, 1)
else:
box_show[i][1] = 0
if box[i+1][1] == 0:
blank_break(i+1, 1)
else:
box_show[i+1][1] = 0
elif i == box_num - 1:
if box[box_num - 1][j - 1] == 0:
blank_break(box_num - 1, j - 1)
else:
box_show[box_num - 1][j - 1] = 0
if box[box_num - 1][j + 1] == 0:
blank_break(box_num - 1, j + 1)
else:
box_show[box_num - 1][j + 1] = 0
if box[box_num - 2][j-1] == 0:
blank_break(box_num - 2, j-1)
else:
box_show[box_num - 2][j-1] = 0
if box[box_num - 2][j] == 0:
blank_break(box_num - 2, j)
else:
box_show[box_num - 2][j] = 0
if box[box_num - 2][j+1] == 0:
blank_break(box_num - 2, j+1)
else:
box_show[box_num - 2][j+1] = 0
elif j == box_num-1:
if box[i - 1][box_num - 1] == 0:
blank_break(i - 1, box_num - 1)
else:
box_show[i - 1][box_num - 1] = 0
if box[i + 1][box_num - 1] == 0:
blank_break(i + 1, box_num - 1)
else:
box_show[i + 1][box_num - 1] = 0
if box[i-1][box_num - 2] == 0:
blank_break(i-1, box_num - 2)
else:
box_show[i-1][box_num - 2] = 0
if box[i][box_num - 2] == 0:
blank_break(i, box_num - 2)
else:
box_show[i][box_num - 2] = 0
if box[i+1][box_num - 2] == 0:
blank_break(i+1, box_num - 2)
else:
box_show[i+1][box_num - 2] = 0
else:
if box[i - 1][j] == 0:
blank_break(i - 1, j)
else:
box_show[i - 1][j] = 0
if box[i - 1][j-1] == 0:
blank_break(i - 1, j-1)
else:
box_show[i - 1][j-1] = 0
if box[i - 1][j+1] == 0:
blank_break(i - 1, j+1)
else:
box_show[i - 1][j+1] = 0
if box[i][j - 1] == 0:
blank_break(i, j - 1)
else:
box_show[i][j - 1] = 0
if box[i][j+1] == 0:
blank_break(i, j+1)
else:
box_show[i][j+1] = 0
if box[i+1][j + 1] == 0:
blank_break(i+1, j + 1)
else:
box_show[i+1][j + 1] = 0
if box[i+1][j] == 0:
blank_break(i+1, j)
else:
box_show[i+1][j] = 0
if box[i+1][j - 1] == 0:
blank_break(i+1, j - 1)
else:
box_show[i+1][j - 1] = 0
return
#블럭 한칸 부수기
def break_block():
global box
global box_show
print("가로 (1~9) 세로 (1~9) : ")
str = input().split(" ")
y = int(str[0])-1
x = int(str[1])-1
if box_show[x][y] == 1:
if box[x][y] == 9:
print("Game Over OTL")
box_show[x][y] = 0
box_print()
return 2
elif box[x][y] == 0:
blank_break(x,y)
else:
box_show[x][y] = 0
elif box_show[x][y] == 0:
print("이미 뚫린 곳입니다.")
count = 0
for i in range(box_num):
for j in range(box_num):
if box_show[i][j] == 0:
count += 1
if count == 71:
print("성공!")
box_print()
return 0
return 1
makemap()
#블럭 부수기 밑 지뢰 체크 반복
while True:
box_print()
print("좌표 뚫기 : 1 , 좌표 지뢰 체크 : 2")
a1 = int(input())
if a1 == 1:
n = break_block()
if n == 2:
break
if n == 0:
break
else:
continue
if a1 == 2:
#지뢰 체크 코
print("가로 (1~9) 세로 (1~9) : ")
str1 = input().split(" ")
y = int(str1[0]) - 1
x = int(str1[1]) - 1
if box_show[x][y] == 1:
box_show[x][y] = 2
elif box_show[x][y] == 2:
box_show[x][y] = 1
elif box_show[x][y] == 0:
print("이미 뚫린 곳입니다.")
질문 환영입니다.
'프로그래밍(주력) > PYTHON' 카테고리의 다른 글
| 텐서플로 프로젝트) mnist 손글씨 인식을 사용한 숫자인식 그림판 (0) | 2017.12.02 |
|---|---|
| 텐서플로 프로젝트) 주가(코인) 예측 프로그램 기획 (2) | 2017.07.03 |
| 파이썬 보고서) 0621 수업 5일차 - 파이썬의 예외처리, 파일입출력 (0) | 2017.06.28 |
| 파이썬 보고서) 0609 수업 2일차 - 파이썬의 연산자 (0) | 2017.06.16 |
| 파이썬 보고서) 0603 수업 1일차 - 파이썬의 기본 (0) | 2017.06.14 |