public static final int R_TARGET = 40;public static final int G_TARGET = 43;public static final int B_TARGET = 86;public int[] find(BufferedImage image) {if (image == null) {return null;}int width = image.getWidth();int height = image.getHeight();int[] ret = {0, 0};int maxX = Integer.MIN_VALUE;int minX = Integer.MAX_VALUE;int maxY = Integer.MIN_VALUE;int minY = Integer.MAX_VALUE;for (int i = 0; i < width; i++) {for (int j = height / 4; j < height * 3 / 4; j++) {//提高搜索速度,因为棋子只会存在于整个图的中部位置int pixel = image.getRGB(i, j);int r = (pixel & 0xff0000) >> 16;int g = (pixel & 0xff00) >> 8;int b = (pixel & 0xff);if (ToleranceHelper.match(r, g, b, R_TARGET, G_TARGET, B_TARGET, 16)) {maxX = Integer.max(maxX, i);minX = Integer.min(minX, i);maxY = Integer.max(maxY, j);minY = Integer.min(minY, j);}}}ret[0] = (maxX + minX) / 2 +3;ret[1] = maxY;System.out.println(maxX + ", " + minX);System.out.println("pos, x: " + ret[0] + ", y: " + ret[1]);return ret;}

/*** desc:棋盘位置搜索*/
public class BoardPositionSearcher implements PositionSearcher {private Logger logger = LoggerFactory.getLogger(this.getClass());private BottleFinder bottleFinder = new BottleFinder();private int[] myPos;public int[] getMyPos() {return myPos;}public void setMyPos(int[] myPos) {this.myPos = myPos;}@Overridepublic int[] seach(BufferedImage screenShotImg) {if (screenShotImg == null) {return null;}int width = screenShotImg.getWidth();int height = screenShotImg.getHeight();//先获取出0 200这一点的像素,即顶部某的一点int pixel = screenShotImg.getRGB(0, 200);int r1 = (pixel & 0xff0000) >> 16;int g1 = (pixel & 0xff00) >> 8;int b1 = (pixel & 0xff);Map<Integer, Integer> map = new HashMap<>();//一列一列地搜索,在map中放入遍历点像素在这一行中出现的次数for (int i = 0; i < width; i++) {pixel = screenShotImg.getRGB(i, height - 1);map.put(pixel, map.getOrDefault(pixel, 0) + 1);}//获取出存在于map中像素出现次数最多的像素int max = 0;for (Map.Entry<Integer, Integer> entry : map.entrySet()) {if (entry.getValue() > max) {pixel = entry.getKey();max = entry.getValue();}}int r2 = (pixel & 0xff0000) >> 16;int g2 = (pixel & 0xff00) >> 8;int b2 = (pixel & 0xff);//获取出游戏背景从顶到底的颜色RGB值int t = 16;int minR = Integer.min(r1, r2) - t;int maxR = Integer.max(r1, r2) + t;int minG = Integer.min(g1, g2) - t;int maxG = Integer.max(g1, g2) + t;int minB = Integer.min(b1, b2) - t;int maxB = Integer.max(b1, b2) + t;logger.trace(minR + ", " + minG + ", " + minB);logger.trace(maxR + ", " + maxG + ", " + maxB);int[] ret = new int[6];int targetR = 0, targetG = 0, targetB = 0;boolean found = false;//遍历寻找棋盘顶点坐标，在棋子坐标上方搜索，从游戏背景4分之一处开始搜索，提高速度for (int backgroundY = height / 4; backgroundY < myPos[1]; backgroundY++) {for (int backgroundX = 0; backgroundX < width; backgroundX++) {int dx = Math.abs(backgroundX - myPos[0]);int dy = Math.abs(backgroundY - myPos[1]);if (dy > dx) {//如果这一点到棋子X的距离比这一点到棋子Y的距离小,就跳出循环， WHY？continue;}//获取出扫描这一点的RGB值pixel = screenShotImg.getRGB(backgroundX, backgroundY);int r = (pixel & 0xff0000) >> 16;int g = (pixel & 0xff00) >> 8;int b = (pixel & 0xff);//如果这一点的RGB值不在屏幕背景色的区间内if (r < minR || r > maxR || g < minG || g > maxG || b < minB || b > maxB) {ret[0] = backgroundX;ret[1] = backgroundY;//则下一步的顶点坐标为这个点logger.trace("top, x: " + backgroundX + ", y: " + backgroundY);//遍历这个点向下5个高度的像素for (int k = 0; k < 5; k++) {pixel = screenShotImg.getRGB(backgroundX, backgroundY + k);targetR += (pixel & 0xff0000) >> 16;targetG += (pixel & 0xff00) >> 8;targetB += (pixel & 0xff);}//取出这个点的像素平均值targetR /= 5;targetG /= 5;targetB /= 5;found = true;break;}}if (found) {break;}}//判断是否为白点if (targetR == BottleFinder.TARGET && targetG == BottleFinder.TARGET && targetB == BottleFinder.TARGET) {return bottleFinder.find(screenShotImg, ret[0], ret[1]);}boolean[][] matchMap = new boolean[width][height];boolean[][] vMap = new boolean[width][height];ret[2] = Integer.MAX_VALUE;ret[3] = Integer.MAX_VALUE;ret[4] = Integer.MIN_VALUE;ret[5] = Integer.MAX_VALUE;Queue<int[]> queue = new ArrayDeque<>();queue.add(ret);while (!queue.isEmpty()) {int[] item = queue.poll();int i = item[0];int j = item[1];if (j >= myPos[1]) {
//                已搜索到棋子的Y值位置了，结束本次搜索，跳出循环continue;}if (i < Integer.max(ret[0] - 300, 0) || i >= Integer.min(ret[0] + 300, width) || j < Integer.max(0, ret[1] - 400) || j >= Integer.max(height, ret[1] + 400) || vMap[i][j]) {
//对于距离棋子坐标太远的跳出循环(即棋子坐标左、右、上、下的坐标),以及已经搜索过的坐标也跳出循环continue;}vMap[i][j] = true;pixel = screenShotImg.getRGB(i, j);int r = (pixel & 0xff0000) >> 16;int g = (pixel & 0xff00) >> 8;int b = (pixel & 0xff);//将每一个坐标点与棋盘顶点的RGB值比较matchMap[i][j] = ToleranceHelper.match(r, g, b, targetR, targetG, targetB, 16);if (i == ret[0] && j == ret[1]) {logger.trace(matchMap[i][j] + "");}//如果在棋盘面上if (matchMap[i][j]) {//获取出最左边的棋盘坐标if (i < ret[2]) {ret[2] = i;ret[3] = j;}//获取最上的棋盘坐标else if (i == ret[2] && j < ret[3]) {ret[2] = i;ret[3] = j;}//获取出最右边的棋盘坐标if (i > ret[4]) {ret[4] = i;ret[5] = j;}//获取出最上的棋盘坐标else if (i == ret[4] && j < ret[5]) {ret[4] = i;ret[5] = j;}//获取出最上的坐标点if (j < ret[1]) {ret[0] = i;ret[1] = j;}//将目标点左右上下的点放入队列中,实现递归queue.add(buildArray(i - 1, j));queue.add(buildArray(i + 1, j));queue.add(buildArray(i, j - 1));queue.add(buildArray(i, j + 1));}}logger.trace("left, x: " + ret[2] + ", y: " + ret[3]);logger.trace("right, x: " + ret[4] + ", y: " + ret[5]);return ret;}private int[] buildArray(int i, int j) {int[] ret = {i, j};return ret;}
}