def find_piece_and_board(im):
 #尋找關(guān)鍵坐標(biāo)
 w, h = im.size

 piece_x_sum = 0
 piece_x_c = 0
 piece_y_max = 0
 board_x = 0
 board_y = 0
 scan_x_border = int(w / 8) # 掃描棋子時的左右邊界
 scan_start_y = 0 # 掃描的起始 y 坐標(biāo)
 im_pixel = im.load()
 # 以 50px 步長，嘗試探測 scan_start_y
 for i in range(int(h / 3), int(h*2 / 3), 50):
 last_pixel = im_pixel[0, i]
 for j in range(1, w):
  pixel = im_pixel[j, i]
  # 不是純色的線，則記錄 scan_start_y 的值，準(zhǔn)備跳出循環(huán)
  if pixel != last_pixel:
  scan_start_y = i - 50
  break
 if scan_start_y:
  break
 print('scan_start_y: {}'.format(scan_start_y))

 # 從 scan_start_y 開始往下掃描，棋子應(yīng)位于屏幕上半部分，這里暫定不超過 2/3
 for i in range(scan_start_y, int(h * 2 / 3)):
 # 橫坐標(biāo)方面也減少了一部分掃描開銷
 for j in range(scan_x_border, w - scan_x_border):
  pixel = im_pixel[j, i]
  # 根據(jù)棋子的最低行的顏色判斷，找最后一行那些點(diǎn)的平均值，這個顏
  # 色這樣應(yīng)該 OK，暫時不提出來
  if (50 < pixel[0] < 60) \
   and (53 < pixel[1] < 63) \
   and (95 < pixel[2] < 110):
  piece_x_sum += j
  piece_x_c += 1
  piece_y_max = max(i, piece_y_max)

 if not all((piece_x_sum, piece_x_c)):
 return 0, 0, 0, 0
 piece_x = int(piece_x_sum / piece_x_c)
 piece_y = piece_y_max - piece_base_height_1_2 # 上移棋子底盤高度的一半