sicily 1936.knight moves

#include<string>
#include<queue>
#include<cstdio>
#include<cstring>
using namespace std;
const int BOARD_SIZE = 8;
int (int last, int way){
	int lastx = last / BOARD_SIZE;
	int lasty = last % BOARD_SIZE;
	int x, y;
	switch (way){
	case 0:
		x = lastx - 1;
		y = lasty + 2;
		break;
	case 1:
		x = lastx + 1;
		y = lasty + 2;
		break;
	case 2:
		x = lastx + 2;
		y = lasty + 1;
		break;
	case 3:
		x = lastx + 2;
		y = lasty - 1;
		break;
	case 4:
		x = lastx + 1;
		y = lasty - 2;
		break;
	case 5:
		x = lastx - 1;
		y = lasty - 2;
		break;
	case 6:
		x = lastx - 2;
		y = lasty - 1;
		break;
	case 7:
		x = lastx - 2;
		y = lasty + 1;
		break;
	}
	if (x < 0 || y < 0 || x >= BOARD_SIZE || y >= BOARD_SIZE){
		return -1;
	}
	return x * BOARD_SIZE + y;
}
struct Board{
	bool board[64];
	int last;
	Board(int last) :last(last){
		for (int i = 0; i < 64; i++){
			board[i] = false;
		}
		board[last] = true;
	}
	Board(const Board& board){
		this->last = board.last;
		memcpy(this->board, board.board, 64);
	}
	void next(int move){
		last = move;
		board[move] = true;
	}
};
int find(int start, int end){
	if (start == end)
		return 0;
	queue<Board*> q1, q2;
	queue<Board*>* curQ = &q1;
	queue<Board*>* nextQ = &q2;
	q1.push(new Board(start));
	int layer = 0;
	while (!curQ->empty() || !nextQ->empty()){
		layer++;
		while (!curQ->empty()){
			Board* cur = curQ->front();
			curQ->pop();
			for (int i = 0; i < 8; i++){
				int next = move(cur->last, i);
				if (next == end){
					return layer;
				}
				if (next != -1 && !cur->board[next]){
					Board* n = new Board(*cur);
					n->next(next);
					nextQ->push(n);
				}
			}
		}
		queue<Board*>* tmp = curQ;
		curQ = nextQ;
		nextQ = tmp;
	}
	return -1;
}
int tran(char m[3]){
	return (m[0] - 'a') * BOARD_SIZE + (m[1] - '0') - 1;
}
int main(){
	int a;
	cin >> a;
	while (a--){
		char start[3];
		char end[3];
		cin >> start >> end;
		start[2] = '