24-Game/functions.py at master · vincentbudianto/24-Game · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
''' NIM/Nama  : 13517020/T. Antra Oksidian Tafly, 13517137/Vincent Budianto, 13517146/Hansen
	Nama file : functions.py
	Topik     : Tugas Besar 1 IF2211-Strategi Algoritma
	Tanggal   : 13 Februari 2019
	Deskripsi : fungsi dan prosedur yang digunakan pada program '''

import sys
import random
from Classes import Numbers,card

#inisiasi global variabel
List=[]
filedir="./Picture/"
fileext=".png"
suit=["S","D","C","H"]
specialcard=["A","J","Q","K"]
totalscore=0

#fungsi tambahan
def initiatedeck(): #inisiasi dek
	deck=[]
	for i in range(1,14):
		for fn in suit:
			if (i==1 or i>10):
				s=filedir+specialcard[(i%10)+(i//10)-1]+fn+fileext
				c=card(i,s)
				deck.append(c)
			else:
				s=filedir+str(i)+fn+fileext
				c=card(i,s)
				deck.append(c)
	return deck

def compare24(num,exp): #menghitung bobot skor
	skor=0
	if (exp=='+'):
		skor+=5
	if (exp=='-'):
		skor+=4
	if (exp=='*'):
		skor+=3
	if (exp=='/'):
		skor+=2
	skor=skor-abs(24-num)
	return skor

def kurung(st,totalscore): #menambahkan kurung pada st
	b=[]
	idx=[]
	i=0
	while (i<len(st)):
		ch=st[i]
		if (ch=='+') or (ch=='-'):
			b.append(False)
			idx.append(i)
		elif (ch=='/') or (ch=='*'):
			b.append(True)
			idx.append(i)
		i+=1
	if (not b[1] and b[2]):
		st="("+st[0:idx[2]]+")"+st[idx[2]:]
		totalscore-=1
	elif (not b[0] and b[1]):
		st="("+st[0:idx[1]]+")"+st[idx[1]:]
		totalscore-=1
	return (st,totalscore)

def partition(data,low,high):
	i = (low - 1)   #index
	pivot = data[high]

	for j in range(low,high):
		#jika nilai sekarang > dari tumpuan
		if data[j] > pivot:
			i = i + 1
			data[i],data[j] = data[j],data[i]

	data[i+1],data[high] = data[high],data[i+1]
	return (i + 1)

def draw4(deck):  #mengambil 4 kartu dari deck (fungsi)
	List=[]
	drawncards=[]

	for i in range (1,5):
		x=random.randint(0,len(deck)-1)
		c=deck.pop(x)
		drawncards.append(c)
		List.append(c.c2n())
	return (List,deck,drawncards)

def Listprocessf(List,totalscore):
	quickSort(List,0,len(List)-1)
	while (len(List)>1):
		N1=List.pop(0)
		N2=List.pop(0)
		if (N1<=24):
			if (compare24(N1+N2,'+')>compare24(N1*N2,'*')):
				N3=N1.operate('+',N2)
				totalscore+=5
			else:
				N3=N1.operate('*',N2)
				totalscore+=3
		else:
			if (compare24(N1-N2,'-')>compare24(N1/N2,'/')):
				N3=N1.operate('-',N2)
				totalscore+=4
			else:
				N3=N1.operate('/',N2)
				totalscore+=2
		List.append(N3)
		quickSort(List,0,len(List)-1)
	return (List,totalscore)

def quickSort (data,low,high):
	if low < high:
		pi = partition(data,low,high)

		quickSort(data,low, pi-1)
		quickSort(data,pi+1, high)