From b08b5fcb89ee76e540b104313de376663c65ddb5 Mon Sep 17 00:00:00 2001
From: Thaloria <thaloria@web.de>
Date: Thu, 20 Jul 2023 19:19:36 +0200
Subject: [PATCH] added first draft litris

---
 litris.py | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/litris.py b/litris.py
index b7e0c15..f219f2d 100644
--- a/litris.py
+++ b/litris.py
@@ -187,27 +187,27 @@ class Litris(GameBase):
 
     def find_place_for_stone(self, stone, current_board):
 
-        if stone == BLOCK_FULL:
+        if np.array_equal(stone, BLOCK_FULL):
             # block
             for e in range(18, 20, 1):
                 for i in range(0, 19, 1):
                     if current_board[e][i] == 0 and current_board[e - 1][i] == 0 and current_board[e][i + 1] == 0 and current_board[e - 1][i + 1] == 0:
                         return i - BLOCK_COL
-        elif stone == L1_FULL:
+        elif np.array_equal(stone, L1_FULL):
             # L1
             for e in range(18, 20, 1):
                 for i in range(0, 19, 1):
                     if current_board[e][i] == 0 and current_board[e][i + 1] == 0 and current_board[e][i + 2] == 0 and \
                             current_board[e - 1][i + 2] == 0:
                         return i - L1_COL
-        elif stone == LINE_FULL:
+        elif np.array_equal(stone, LINE_FULL):
             # Line
             for e in range(19, 20, 1):
                 for i in range(0, 19, 1):
                     if current_board[e][i] == 0 and current_board[e][i + 1] == 0 and current_board[e][i + 2] == 0 and \
                             current_board[e][i + 3] == 0:
                         return i - LINE_COL
-        elif stone == DOT_FULL:
+        elif np.array_equal(stone, DOT_FULL):
             # Dot
             for e in range(19, 20, 1):
                 for i in range(0, 19, 1):