yoshuanava / dd2380_project Goto Github PK

    def getChildren(self):
        children = []
        # Translations relative to the middle of the board
        for translation in range(-5, 6, 1):
            for rotation in range(0, 4, 1):  # Number of rotations
                # Simulate the game by dong a few rotations and translations: get the new state (for each performed move)
                new_state = GameState.TetrisGame(self.state.grid, self.state.curr_piece, self.state.next_piece, rotation, translation)
                action = (rotation, translation)
                child = GameNode(new_state, self, action)
                children.append(child)
                # Calculate the hash value
                # hash_val = abs(hash(new_state_string))
                # Check for hash collision
                # if (self.hashtable[hash_val % 1000000] == 0):
                #     self.hashtable[hash_val % 1000000] = 1
                #     child = GameNode(new_state.getGrid(), piece, next_piece, new_state.getActions())
                #     self.children.append(child)
        return children

        print("-------- Simulation --------")
        points = 0
        itr = 1
        child = node

        while (itr <= self.max_length):
            # Get all the possible actions, and choose a random one. Predict the next state and evaluate it with the heuristic function
            children = child.getChildren()
            child = random.choice(children)
            points += th.heuristic(child.state.grid)   # Run heuristic here
            itr += 1