Procházet zdrojové kódy

Use a fixed delay instead of looking at moves, gives some hickups but seems to work better overall

Taddeus Kroes před 5 roky
rodič
revize
29be6a54a7
2 změnil soubory, kde provedl 7 přidání a 5 odebrání
  1. 5 4
      bot.py
  2. 2 1
      strategy.py

+ 5 - 4
bot.py

@@ -80,10 +80,11 @@ if __name__ == '__main__':
 
                 press_keys(win, solution.keys())
 
-                keys_delay = len(solution.moves) * 2 * KEY_DELAY
-                moves_delay = max(0, solution.delay() - keys_delay)
-                vprint('wait for',  moves_delay, 'ms')
-                time.sleep(moves_delay / 1000)
+                #keys_delay = len(solution.moves) * 2 * KEY_DELAY
+                #moves_delay = max(0, solution.delay() - keys_delay)
+                #vprint('wait for',  moves_delay, 'ms')
+                #time.sleep(moves_delay / 1000)
+                time.sleep(0.070)
             elif state.nrows() - 2 <= MAX_SPEED_ROWS:
                 vprint('no moves, speed up')
                 press_keys(win, 'l')

+ 2 - 1
strategy.py

@@ -90,7 +90,8 @@ class State:
     def score(self, points, moves, prev):
         prev_colsize = prev.nrows() - 2
 
-        delay = moves_delay(moves)
+        #delay = moves_delay(moves)
+        delay = len(moves)
 
         # Don't care about defragging for few rows, just score points quickly.
         # This saves computation time which in turn makes for nice combos when