Chess-Project/dataStructures.py at master · Karan-shf/Chess-Project · 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
class Stack:

    def __init__(self,max) -> None:
        self.top = -1
        self.max = max
        self.properties = []
        for i in range(max):
            self.properties.append(None)

    def push(self,value):

        if self.isFull():
            raise Exception('Stack is Full')
        else:
            self.top += 1
            self.properties[self.top] = value

    def pop(self):

        if self.isEmpty():
            raise Exception('Stack is Empty')
        else:
            index = self.top
            self.top -=1
            return self.properties[index]

    def isFull(self):

        if self.max-1 == self.top:
            return True
        else:
            return False

    def isEmpty(self):

        if self.top==-1:
            return True
        else:
            return False

    def printProperties(self):

        for i in range(self.top,-1,-1):
            print(self.properties[i])

    def clear(self):
        self.properties.clear()
        for i in range(self.max):
            self.properties.append(None)
        self.top = -1

    def count(self):
        return self.top + 1

class Queue:

    def __init__(self,max) -> None:

        self.rear = -1
        self.front = -1
        self.max = max
        self.properties = []
        for i in range(max):
            self.properties.append(None)

    def add(self,value):

        if self.isFull():
            raise Exception('Queue is Full')
        else:
            self.rear +=1
            self.properties[self.rear]=value

    def dequeue(self):

        if self.isEmpty():
            raise Exception('Queue is Empty')
        else:
            self.front+=1
            return self.properties[self.front]

    def isFull(self):

        if self.max-1 == self.rear:
            return True
        else:
            return False

    def isEmpty(self):

        if self.front==self.rear:
            return True
        else:
            return False

    def printProperties(self):

        for i in range(self.front+1,self.rear+1):
            print(self.properties[i])

    def clear(self):
        self.properties.clear()
        for i in range(self.max):
            self.properties.append(None)
        self.rear = -1
        self.front = -1


game_moves = Queue(12000)

game_moves_stack = Stack(12000)
game_moves_temp_stack = Stack(12000)