EESAST
/
THUAI6
Not watched
1
0
Fork 0
Code
Releases 3 Wiki evaluate Activity
Issues 0 Pull Requests 0 Datasets Model Cloudbrain HPC
You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.
Branch: dev
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from 'dev'
${ noResults }
THUAI6/players/closeAI/player4.cpp

1015 lines
37 kB
Raw Permalink Blame History 

  1. #include <vector>

  2. #include <thread>

  3. #include <array>

  4. #include "AI.h"

  5. #include "constants.h"

  6. 

  7. // 为假则play()期间确保游戏状态不更新，为真则只保证游戏状态在调用相关方法时不更新

  8. extern const bool asynchronous = false;

  9. static int flag = 0;

  10. static int flagg = 0;

  11. static int flaggg = 0;

  12. static int flagggg = 0;

  13. double angle = 0;

  14. static int homework = 0;

  15. int homework_19_6 = 0;

  16. int homework_31_8 = 0;

  17. int homework_23_19 = 0;

  18. int homework_9_30 = 0;

  19. int homework_11_39 = 0;

  20. int homework_20_42 = 0;

  21. int homework_29_27 = 0;

  22. int homework_34_41 = 0;

  23. int homework_41_13 = 0;

  24. int homework_46_33 = 0;

  25. // 选手需要依次将player0到player4的职业在这里定义

  26. 

  27. extern const std::array<THUAI6::StudentType, 4> studentType = {

  28.     THUAI6::StudentType::StraightAStudent,

  29.     THUAI6::StudentType::StraightAStudent,

  30.     THUAI6::StudentType::StraightAStudent,

  31.     THUAI6::StudentType::StraightAStudent };

  32. 

  33. extern const THUAI6::TrickerType trickerType = THUAI6::TrickerType::Assassin;

  34. 

  35. int ArrayLen(int* a)

  36. {

  37.     int i = 0;

  38.     while (a[i] != 0)

  39.         i++;

  40.     return i;

  41. }

  42. 

  43. int* UpLeft(int dx, int dy, int x, int y, IStudentAPI& api)       //会返回一串形如101000111的字符(数字应有dx+dy-1位，若不足，则在高位自动补足0)//

  44. {                                                                   //从左往右每个数字代表一步，0代表向上一步，1代表向左一步//

  45.     int a[200] = { 0 }, *c, b[1];

  46.     b[0] = 3;

  47.     int flag = 0, i = 0;

  48.     if (dx == 0)

  49.     {

  50.         for (int i = 1; i < dy; i++)

  51.         {

  52.             if (api.GetPlaceType(api.GridToCell(x), api.GridToCell(y) - i) == THUAI6::PlaceType::Wall || api.GetPlaceType(api.GridToCell(x), api.GridToCell(y) - i) == THUAI6::PlaceType::Window)

  53.             {

  54.                 flag = 1; break;

  55.             }

  56.             else a[++i]=2;

  57.         }

  58.         if (flag == 1)  return b;

  59.         else return a;

  60.     }

  61.     flag = 0;

  62.     if (dy == 0)

  63.     {

  64.         for (int i = 0; i < dx; i++)

  65.         {

  66.             if (api.GetPlaceType(api.GridToCell(x) - i, api.GridToCell(y)) == THUAI6::PlaceType::Wall || api.GetPlaceType(api.GridToCell(x) - i, api.GridToCell(y)) == THUAI6::PlaceType::Window)

  67.             {

  68.                 flag = 1; break;

  69.             }

  70.             else a[++i]=1;

  71.         }

  72.         if (flag == 1)  return b;

  73.         else   return a;

  74.     }

  75.     if (*(UpLeft(dx, dy - 1, x, y - 1000, api)) != 3 && api.GetPlaceType(api.GridToCell(x), api.GridToCell(y) - 1) != THUAI6::PlaceType::Wall && api.GetPlaceType(api.GridToCell(x), api.GridToCell(y) - 1) != THUAI6::PlaceType::Window)

  76.     {

  77.         c = UpLeft(dx, dy - 1, x, y - 1000, api);

  78.         for (int i = 0; i < ArrayLen(c); i++)

  79.             a[i] = c[i];

  80.         a[ArrayLen(c)] = 2;

  81.         return a;

  82.     }

  83.     if (*(UpLeft(dx - 1, dy, x - 1000, y, api)) != 3 && api.GetPlaceType(api.GridToCell(x) - 1, api.GridToCell(y)) != THUAI6::PlaceType::Wall && api.GetPlaceType(api.GridToCell(x) - 1, api.GridToCell(y)) != THUAI6::PlaceType::Window)

  84.     {

  85.         c = UpLeft(dx - 1, dy, x - 1000, y, api);

  86.         for (int i = 0; i < ArrayLen(c); i++)

  87.             a[i] = c[i];

  88.         a[ArrayLen(c)] = 1;

  89.         return a;

  90.     }

  91.     else return b;

  92. }

  93. 

  94. /*

  95. long long UpRight(int dx, int dy, int x, int y, IStudentAPI& api)       //会输出一串形如101000111的数字(数字应有dx+dy-1位，若不足，则在高位自动补足0)//

  96. {                                                                   //从右往左每个数字代表一步，0代表向上一步，1代表向右一步//

  97.     int a = 0, flag = 0;

  98.     if (dx == 0)

  99.     {

  100.         for (int i = 1; i < dy; i++)

  101.         {

  102.             if (api.GetPlaceType(api.GridToCell(x), api.GridToCell(y) + i) == THUAI6::PlaceType::Wall || api.GetPlaceType(api.GridToCell(x), api.GridToCell(y) + i) == THUAI6::PlaceType::Window)

  103.             {

  104.                 flag = 1; break;

  105.             }

  106.             else a = a * 10 + 1;

  107.         }

  108.         if (flag == 1)  return 2;

  109.         else return a;

  110.     }

  111.     flag = 0;

  112.     if (dy == 0)

  113.     {

  114.         for (int i = 0; i < dx; i++)

  115.         {

  116.             if (api.GetPlaceType(api.GridToCell(x) - i, api.GridToCell(y)) == THUAI6::PlaceType::Wall || api.GetPlaceType(api.GridToCell(x) - i, api.GridToCell(y)) == THUAI6::PlaceType::Window)

  117.             {

  118.                 flag = 1; break;

  119.             }

  120.             else a = a * 10 + 0;

  121.         }

  122.         if (flag == 1)  return 2;

  123.         else return a;

  124.     }

  125.     if (UpLeft(dx, dy - 1, x, y + 1000, api) != 2 && api.GetPlaceType(api.GridToCell(x), api.GridToCell(y) + 1) != THUAI6::PlaceType::Wall && api.GetPlaceType(api.GridToCell(x), api.GridToCell(y) + 1) != THUAI6::PlaceType::Window)

  126.     {

  127.         return 10 * UpLeft(dx, dy - 1, x, y + 1000, api) + 1;

  128.     }

  129.     if (UpLeft(dx - 1, dy, x - 1000, y, api) != 2 && api.GetPlaceType(api.GridToCell(x) - 1, api.GridToCell(y)) != THUAI6::PlaceType::Wall && api.GetPlaceType(api.GridToCell(x) - 1, api.GridToCell(y)) != THUAI6::PlaceType::Window)

  130.     {

  131.         return 10 * UpLeft(dx - 1, dy, x - 1000, y, api);

  132.     }

  133.     else return 2;

  134. }

  135. 

  136. long long DownLeft(int dx, int dy, int x, int y, IStudentAPI& api)       //会输出一串形如101000111的数字(数字应有dx+dy-1位，若不足，则在高位自动补足0)//

  137. {                                                                   //从右往左每个数字代表一步，0代表向下一步，1代表向左一步//

  138.     int a = 0, flag = 0;

  139.     if (dx == 0)

  140.     {

  141.         for (int i = 1; i < dy; i++)

  142.         {

  143.             if (api.GetPlaceType(api.GridToCell(x), api.GridToCell(y) - i) == THUAI6::PlaceType::Wall || api.GetPlaceType(api.GridToCell(x), api.GridToCell(y) - i) == THUAI6::PlaceType::Window)

  144.             {

  145.                 flag = 1; break;

  146.             }

  147.             else a = a * 10 + 1;

  148.         }

  149.         if (flag == 1)  return 2;

  150.         else return a;

  151.     }

  152.     flag = 0;

  153.     if (dy == 0)

  154.     {

  155.         for (int i = 0; i < dx; i++)

  156.         {

  157.             if (api.GetPlaceType(api.GridToCell(x) + i, api.GridToCell(y)) == THUAI6::PlaceType::Wall || api.GetPlaceType(api.GridToCell(x) + i, api.GridToCell(y)) == THUAI6::PlaceType::Window)

  158.             {

  159.                 flag = 1; break;

  160.             }

  161.             else a = a * 10 + 0;

  162.         }

  163.         if (flag == 1)  return 2;

  164.         else return a;

  165.     }

  166.     if (UpLeft(dx, dy - 1, x, y - 1000, api) != 2 && api.GetPlaceType(api.GridToCell(x), api.GridToCell(y) - 1) != THUAI6::PlaceType::Wall && api.GetPlaceType(api.GridToCell(x), api.GridToCell(y) - 1) != THUAI6::PlaceType::Window)

  167.     {

  168.         return 10 * UpLeft(dx, dy - 1, x, y - 1000, api) + 1;

  169.     }

  170.     if (UpLeft(dx - 1, dy, x + 1000, y, api) != 2 && api.GetPlaceType(api.GridToCell(x) + 1, api.GridToCell(y)) != THUAI6::PlaceType::Wall && api.GetPlaceType(api.GridToCell(x) + 1, api.GridToCell(y)) != THUAI6::PlaceType::Window)

  171.     {

  172.         return 10 * UpLeft(dx - 1, dy, x + 1000, y, api);

  173.     }

  174.     else return 2;

  175. }

  176. 

  177. long long DownRight(int dx, int dy, int x, int y, IStudentAPI& api)       //会输出一串形如101000111的数字(数字应有dx+dy-1位，若不足，则在高位自动补足0)//

  178. {                                                                   //从右往左每个数字代表一步，0代表向下一步，1代表向右一步//

  179.     int a = 0, flag = 0;

  180.     if (dx == 0)

  181.     {

  182.         for (int i = 1; i < dy; i++)

  183.         {

  184.             if (api.GetPlaceType(api.GridToCell(x), api.GridToCell(y) + i) == THUAI6::PlaceType::Wall || api.GetPlaceType(api.GridToCell(x), api.GridToCell(y) + i) == THUAI6::PlaceType::Window)

  185.             {

  186.                 flag = 1; break;

  187.             }

  188.             else a = a * 10 + 1;

  189.         }

  190.         if (flag == 1)  return 2;

  191.         else return a;

  192.     }

  193.     flag = 0;

  194.     if (dy == 0)

  195.     {

  196.         for (int i = 0; i < dx; i++)

  197.         {

  198.             if (api.GetPlaceType(api.GridToCell(x) + i, api.GridToCell(y)) == THUAI6::PlaceType::Wall || api.GetPlaceType(api.GridToCell(x) + i, api.GridToCell(y)) == THUAI6::PlaceType::Window)

  199.             {

  200.                 flag = 1; break;

  201.             }

  202.             else a = a * 10 + 0;

  203.         }

  204.         if (flag == 1)  return 2;

  205.         else return a;

  206.     }

  207.     if (UpLeft(dx, dy - 1, x, y + 1000, api) != 2 && api.GetPlaceType(api.GridToCell(x), api.GridToCell(y) + 1) != THUAI6::PlaceType::Wall && api.GetPlaceType(api.GridToCell(x), api.GridToCell(y) + 1) != THUAI6::PlaceType::Window)

  208.     {

  209.         return 10 * UpLeft(dx, dy - 1, x, y + 1000, api) + 1;

  210.     }

  211.     if (UpLeft(dx - 1, dy, x + 1000, y, api) != 2 && api.GetPlaceType(api.GridToCell(x) + 1, api.GridToCell(y)) != THUAI6::PlaceType::Wall && api.GetPlaceType(api.GridToCell(x) + 1, api.GridToCell(y)) != THUAI6::PlaceType::Window)

  212.     {

  213.         return 10 * UpLeft(dx - 1, dy, x + 1000, y, api);

  214.     }

  215.     else return 2;

  216. }

  217. 

  218. //可以在AI.cpp内部声明变量与函数

  219. */

  220. 

  221. void MoveTo(int des_x, int des_y, IStudentAPI& api, double speed, int a)//走到cell坐标为（des_x，des_y)的函数,speed是api每秒移动的速度

  222. {

  223.     if (a == 0)

  224.     {

  225.         auto p = api.GetSelfInfo();

  226.         int x_cell = api.GridToCell(p->x);

  227.         int y_cell = api.GridToCell(p->y);

  228.         int* step;//用于记录走到目的地所需要的步骤

  229.         double time_ms = (1000.0 / (speed)) * 1000;

  230.         int len = abs((x_cell - des_x)/2) + abs((y_cell - des_y)/2) - 2;

  231.         if (x_cell > des_x && y_cell > des_y)

  232.         {

  233.            

  234.             step = UpLeft(abs((x_cell - des_x) / 2), abs((y_cell - des_y) / 2), p->x, p->y, api);

  235.             //std::this_thread::sleep_for(std::chrono::milliseconds(int(time_ms*20)));

  236.            while(len>=0)

  237.            {

  238.                 if (step[len] == 1)

  239.                 {

  240.                     //std::this_thread::sleep_for(std::chrono::milliseconds(int(time_ms)));

  241.                     api.MoveUp(time_ms);

  242.                     

  243.                 }

  244.                 if (step[len] == 2)

  245.                 {

  246.                     //std::this_thread::sleep_for(std::chrono::milliseconds(int(time_ms)));

  247.                     api.MoveLeft(time_ms);

  248.                   

  249.                 }

  250.                 len--;

  251.             }

  252. 

  253.         }

  254.         //MoveTo(des_x, des_y, api, 2880,1);

  255.     }

  256.     else 

  257.     {

  258.         auto p = api.GetSelfInfo();

  259.         int x_cell = api.GridToCell(p->x);

  260.         int y_cell = api.GridToCell(p->y);

  261.         int* step;//用于记录走到目的地所需要的步骤

  262.         double time_ms = (1000.0 / (speed)) * 1000;

  263.         int len = abs(x_cell - des_x) + abs(y_cell - des_y) - 2;

  264.         step = UpLeft(abs(x_cell - des_x), abs(y_cell - des_y), p->x, p->y, api);

  265.         if (x_cell > des_x && y_cell > des_y)

  266.         {

  267.             while (len >= 0)

  268.             {

  269.                 if (step[len] == 1)

  270.                 {

  271.                     api.MoveUp(time_ms);

  272.                     std::this_thread::sleep_for(std::chrono::milliseconds(int(time_ms)));

  273.                 }

  274.                 if (step[len] == 2)

  275.                 {

  276.                     api.MoveLeft(time_ms);

  277.                     std::this_thread::sleep_for(std::chrono::milliseconds(int(time_ms)));

  278.                 }

  279.                 len--;

  280.             }

  281.         }

  282. 

  283.     }

  284.     //else if(x_cell > des_x && y_cell < des_y) step = UpRight(abs(x_cell - des_x), abs(y_cell - des_y), x_cell, y_cell,api);

  285.     //else if (x_cell < des_x && y_cell > des_y) step = DownLeft(abs(x_cell - des_x), abs(y_cell - des_y), x_cell, y_cell, api);

  286.     //else if (x_cell< des_x && y_cell < des_y) step = DownRight(abs(x_cell - des_x), abs(y_cell - des_y), x_cell, y_cell, api);

  287. }

  288. void DoHomework(int a, int b, IStudentAPI& api)//写作业函数，这部分可能会有问题         @@@（需要测试）

  289. {

  290.     auto p1 = api.GetSelfInfo();

  291.     int x1 = api.GridToCell(p1->x);

  292.     int y1 = api.GridToCell(p1->y);

  293.     auto judge1 = api.GetPlaceType(x1 - 1, y1);

  294.     auto judge2 = api.GetPlaceType(x1 + 1, y1);

  295.     auto judge3 = api.GetPlaceType(x1, y1 - 1);

  296.     auto judge4 = api.GetPlaceType(x1, y1 + 1);

  297.     if (((judge1 == THUAI6::PlaceType::ClassRoom) || (judge2 == THUAI6::PlaceType::ClassRoom) || (judge3 == THUAI6::PlaceType::ClassRoom) || (judge4 == THUAI6::PlaceType::ClassRoom)) && (api.GetClassroomProgress(a, b) < 10000000))

  298.     {

  299.         api.StartLearning();

  300.     }

  301.     if (((judge1 == THUAI6::PlaceType::ClassRoom) || (judge2 == THUAI6::PlaceType::ClassRoom) || (judge3 == THUAI6::PlaceType::ClassRoom) || (judge4 == THUAI6::PlaceType::ClassRoom)) && (api.GetClassroomProgress(a, b) >= 10000000))

  302.     {

  303.         api.EndAllAction();

  304.         api.Wait();

  305.     }

  306. }

  307. void Opendoor(int a, int b, IStudentAPI& api)//开大门函数，这部分可能会有问题         @@@（需要测试）

  308. {

  309.     auto p1 = api.GetSelfInfo();

  310.     int x1 = api.GridToCell(p1->x);

  311.     int y1 = api.GridToCell(p1->y);

  312.     auto judge1 = api.GetPlaceType(x1 - 1, y1);

  313.     auto judge2 = api.GetPlaceType(x1 + 1, y1);

  314.     auto judge3 = api.GetPlaceType(x1, y1 - 1);

  315.     auto judge4 = api.GetPlaceType(x1, y1 + 1);

  316.     if (((judge1 == THUAI6::PlaceType::Gate) || (judge2 == THUAI6::PlaceType::Gate) || (judge3 == THUAI6::PlaceType::Gate) || (judge4 == THUAI6::PlaceType::Gate)) && (api.GetGateProgress(a, b) < 18000))

  317.     {

  318.         api.StartOpenGate();

  319.     }

  320.     if (((judge1 == THUAI6::PlaceType::ClassRoom) || (judge2 == THUAI6::PlaceType::ClassRoom) || (judge3 == THUAI6::PlaceType::ClassRoom) || (judge4 == THUAI6::PlaceType::ClassRoom)) && (api.GetGateProgress(a, b) >= 18000))

  321.     {

  322.         api.EndAllAction();

  323.         api.Wait();

  324.         api.Graduate();

  325.     }

  326. }

  327. void GetToTheNearestHomework(IStudentAPI& api)//找到离自己最近的未完成作业并且走到作业

  328. {

  329.     auto p1 = api.GetSelfInfo();

  330.     int x1 = api.GridToCell(p1->x);

  331.     int y1 = api.GridToCell(p1->y);

  332.     int distance[10][3];

  333.     distance[0][0] = { (1000 * homework_19_6 + abs(x1 - 19) + abs(y1 - 6)) }; distance[0][1] = 19; distance[0][2] = 6;

  334.     distance[1][0] = { 1000 * homework_31_8 + abs(x1 - 31) + abs(y1 - 8) }; distance[1][1] = 31; distance[1][2] = 8;

  335.     distance[2][0] = { 1000 * homework_23_19 + abs(x1 - 23) + abs(y1 - 19) }; distance[2][1] = 23; distance[2][2] = 19;

  336.     distance[3][0] = { 1000 * homework_9_30 + abs(x1 - 9) + abs(y1 - 30) }; distance[3][1] = 9; distance[3][2] = 30;

  337.     distance[4][0] = { 1000 * homework_11_39 + abs(x1 - 11) + abs(y1 - 39) }; distance[4][1] = 11; distance[4][2] = 39;

  338.     distance[5][0] = { 1000 * homework_20_42 + abs(x1 - 20) + abs(y1 - 42) }; distance[5][1] = 20; distance[5][2] = 42;

  339.     distance[6][0] = { 1000 * homework_29_27 + abs(x1 - 29) + abs(y1 - 27) }; distance[6][1] = 29; distance[6][2] = 27;

  340.     distance[7][0] = { 1000 * homework_34_41 + abs(x1 - 34) + abs(y1 - 41) }; distance[7][1] = 34; distance[7][2] = 41;

  341.     distance[8][0] = { 1000 * homework_41_13 + abs(x1 - 41) + abs(y1 - 13) }; distance[8][1] = 41; distance[8][2] = 13;

  342.     distance[9][0] = { 1000 * homework_46_33 + abs(x1 - 46) + abs(y1 - 33) }; distance[9][1] = 46; distance[9][2] = 33;

  343.     //这边需要个冒泡排序求出distance[i][0]的最大值         @@@

  344.     //移动到(distance[i][1],distance[i][2])         @@@

  345. }

  346. void RunAway(IStudentAPI& api)//逃离监管者函数

  347. {

  348.     auto self = api.GetSelfInfo();

  349.     int x1 = api.GridToCell(self->x); int y1 = api.GridToCell(self->y);

  350.     auto Trick = api.GetTrickers();

  351.     int x2 = 0, y2 = 0;

  352.     if (!Trick.empty())

  353.     {

  354.         x2 = Trick[0]->x; y2 = Trick[0]->y;

  355.     }

  356.     else

  357.     {

  358.         x2 = x1; y2 = y1;

  359.     }

  360.     //这边写一个反向逃离Tricker的Move函数进去，前面x1,y1是自己的位置，x2,y2是Tricker的位置，但是极坐标这里我不太熟        @@@

  361. 

  362. }

  363. void PlayerCarryOut(IStudentAPI& api)

  364. {

  365.     auto self = api.GetSelfInfo();

  366.     int x = api.GridToCell(self->x); int y = api.GridToCell(self->y);

  367.     if (((x <= 17) && (y <= 5)) || ((x <= 10) && (y >= 5) && (y <= 12)))       //一号区，去（6，7）看门的情况

  368.     {

  369.         auto gameinfo = api.GetGameInfo();

  370.         if (gameinfo->subjectFinished < 7)//门未达到开启条件

  371.         {

  372.             GetToTheNearestHomework(api);

  373.         }

  374.         else//门达到了开启条件

  375.         {

  376.             if (api.GetGateProgress(6, 7) < 18000)

  377.             {

  378.                 //写一个走到（6，7）的函数         @@@

  379.                 Opendoor(6, 7, api);

  380.             }

  381.             else

  382.             {

  383.                 //写一个走到（6，7）的函数         @@@

  384.                 api.EndAllAction();

  385.                 api.Graduate();

  386.             }

  387.         }

  388.     }

  389.     if ((x <= 6) && (y > 13) && (y <= 26))   //二号区，去开箱，此处还没完成捡道具；

  390.     {

  391.         //走到（5，16）         @@@

  392.         if (api.GetChestProgress(5, 16) < 10000000)

  393.         {

  394.             api.StartOpenChest();

  395.         }

  396.         else

  397.         {

  398.             GetToTheNearestHomework(api);

  399.         }

  400. 

  401.     }

  402.     if ((x > 6) && (x <= 12) && (y > 13) && (y <= 26))//三号区，走到（12，21）翻入3教

  403.     {

  404.         //走到（12，21）         @@@

  405.         if (api.GetPlaceType(x + 1, y) == THUAI6::PlaceType::Window)

  406.         {

  407.             api.SkipWindow();

  408.         }

  409.     }

  410.     if ((x <= 6) && (y >= 27) && (y <= 41))//四号区，翻墙进入五教

  411.     {

  412.         //走到(5,33)         @@@

  413.         if (api.GetPlaceType(x + 1, y) == THUAI6::PlaceType::Window)

  414.         {

  415.             api.SkipWindow();

  416.         }

  417.     }

  418.     if (((x <= 6) && (y >= 42) && (y <= 50)) || ((x >= 7) && (x <= 9) && (y >= 45) && (y <= 50)))//五号区，开箱，问题同二号区

  419.     {

  420.         //走到（5，46）         @@@

  421.         if (api.GetChestProgress(5, 46) < 10000000)

  422.         {

  423.             api.StartOpenChest();

  424.         }

  425.         else

  426.         {

  427.             GetToTheNearestHomework(api);

  428.         }

  429. 

  430.     }

  431.     if (((x >= 13) && (x <= 14) && (y >= 24) && (y <= 35)) || ((x >= 15) && (x <= 19) && (y >= 24) && (y <= 31)) || ((x >= 20) && (x <= 21) && (y >= 21) && (y <= 28)))

  432.         //六号区，翻入五教

  433.     {

  434.         //走到（18，30）         @@@

  435.         if (api.GetPlaceType(x, y + 1) == THUAI6::PlaceType::Window)

  436.         {

  437.             api.SkipWindow();

  438.         }

  439.     }

  440.     if (((x >= 22) && (x <= 23) && (y >= 22) && (y <= 29)) || ((x >= 24) && (x <= 27) && (y >= 22) && (y <= 40)))

  441.         //七号区，翻到六教

  442.     {

  443.         //走到（26,35）         @@@

  444.         if (api.GetPlaceType(x + 1, y) == THUAI6::PlaceType::Window)

  445.         {

  446.             api.SkipWindow();

  447.         }

  448.     }

  449.     if (((x >= 10) && (x <= 21) && (y >= 47) && (y <= 50)) || ((x >= 22) && (x <= 29) && (y >= 41) && (y <= 50)) || ((x >= 30) && (x <= 38) && (y >= 45) && (y <= 50)))

  450.     {

  451.         //八号区，走到（29，40）附近

  452.         if (api.IsDoorOpen(29, 40) == true)

  453.         {

  454.             //走到（29，38）         @@@

  455.         }

  456.         else

  457.         {

  458.             //走到（39，43）         @@@

  459.             if (api.GetPlaceType(x - 1, y) == THUAI6::PlaceType::Window)

  460.             {

  461.                 api.SkipWindow();

  462.             }

  463.         }

  464.     }

  465.     if (((x > 39) && (x <= 43) && (y >= 33) && (y <= 39)) || ((x >= 39) && (x <= 50) && (y >= 40) && (y <= 50)))//第九区，看门（47，46）

  466.     {

  467.         auto gameinfo = api.GetGameInfo();

  468.         if (gameinfo->subjectFinished < 7)//门未达到开启条件

  469.         {

  470.             GetToTheNearestHomework(api);

  471.         }

  472.         else//门达到了开启条件

  473.         {

  474.             if (api.GetGateProgress(47, 46) < 18000)//此处对于GetGateProgress的使用存疑

  475.             {

  476.                 //写一个走到（47，46）的函数         @@@

  477.                 Opendoor(47, 46, api);

  478.             }

  479.             else

  480.             {

  481.                 //写一个走到（47，46）的函数         @@@

  482.                 api.EndAllAction();

  483.                 api.Graduate();

  484.             }

  485.         }

  486.     }

  487.     if (((x >= 28) && (x <= 31) && (y >= 11) && (y <= 21)) || ((x >= 32) && (x <= 33) && (y >= 11) && (y <= 28)) || ((x >= 34) && (x <= 38) && (y >= 9) && (y <= 17)))

  488.         //第十区，走到（27，11）翻墙进入三教

  489.     {

  490.         //走到（28，11）         @@@

  491.         if (api.GetPlaceType(x - 1, y) == THUAI6::PlaceType::Window)

  492.         {

  493.             api.SkipWindow();

  494.         }

  495.     }

  496.     if ((x >= 33) && (x <= 39) && (y >= 0) && (y <= 8))//第十一区，走到（38，3）开箱

  497.     {

  498.         //走到（38，3）附近         @@@

  499.         if (api.GetChestProgress(38, 3) < 10000000)

  500.         {

  501.             api.StartOpenChest();

  502.         }

  503.         else

  504.         {

  505.             GetToTheNearestHomework(api);

  506.         }

  507.     }

  508.     if (((x >= 40) && (x <= 43) && (y >= 0) && (y <= 8)) || ((x >= 44) && (x <= 50) && (y >= 0) && (y <= 18)))

  509.         //第十二区，翻（42，18）进入三教

  510.     {

  511.         //走到（43，18）         @@@

  512.         if (api.GetPlaceType(x - 1, y) == THUAI6::PlaceType::Window)

  513.         {

  514.             api.SkipWindow();

  515.         }

  516.     }

  517.     if ((x >= 48) && (x <= 50) && (y >= 21) && (y <= 34))//第十三区，翻（47，27）进入三教

  518.     {

  519.         //走到（48，27）         @@@

  520.         if (api.GetPlaceType(x - 1, y) == THUAI6::PlaceType::Window)

  521.         {

  522.             api.SkipWindow();

  523.         }

  524.     }

  525.     if (((x >= 12) && (x <= 17) && (y >= 5) && (y <= 12)) || ((x >= 18) && (x <= 21) && (y >= 0) && (y <= 12)))

  526.         //作业一区，到（19，6）做作业

  527.     {

  528.         //走到（19，6）         @@@

  529.         if (homework_19_6 == 0)

  530.         {

  531.             DoHomework(19, 6, api);

  532.             if (api.GetClassroomProgress(19, 6) >= 10000000)

  533.             {

  534.                 homework_19_6 = 1;

  535.             }

  536.         }

  537.         else

  538.         {

  539.             GetToTheNearestHomework(api);

  540.         }

  541.     }

  542.     if (((x >= 22) && (x <= 32) && (y >= 4) && (y <= 10)) || ((x >= 22) && (x <= 27) && (y >= 10) && (y <= 12)))

  543.         //作业二区，到（31，8）做作业

  544.     {

  545.         //走到（31,8）         @@@

  546.         if (homework_31_8 == 0)

  547.         {

  548.             DoHomework(31, 8, api);

  549.             if (api.GetClassroomProgress(31, 8) >= 10000000)

  550.             {

  551.                 homework_31_8 = 1;

  552.             }

  553.         }

  554.         else

  555.         {

  556.             GetToTheNearestHomework(api);

  557.         }

  558.     }

  559.     if (((x >= 13) && (x <= 27) && (y >= 13) && (y <= 21)))

  560.         //作业三区，到（23，19）做作业

  561.     {

  562.         //走到（23,19）         @@@

  563.         if (homework_23_19 == 0)

  564.         {

  565.             DoHomework(23, 19, api);

  566.             if (api.GetClassroomProgress(23, 19) >= 10000000)

  567.             {

  568.                 homework_23_19 = 1;

  569.             }

  570.         }

  571.         else

  572.         {

  573.             GetToTheNearestHomework(api);

  574.         }

  575.     }

  576.     if (((x >= 7) && (x <= 11) && (y >= 27) && (y <= 35)))

  577.         //作业四区，到（9，30）做作业

  578.     {

  579.         //走到（9,30）         @@@

  580.         if (homework_9_30 == 0)

  581.         {

  582.             DoHomework(9, 30, api);

  583.             if (api.GetClassroomProgress(9, 30) >= 10000000)

  584.             {

  585.                 homework_9_30 = 1;

  586.             }

  587.         }

  588.         else

  589.         {

  590.             GetToTheNearestHomework(api);

  591.         }

  592.     }

  593.     if (((x >= 7) && (x <= 15) && (y >= 36) && (y <= 43)) || ((x >= 11) && (x <= 13) && (y >= 44) && (y <= 48)))

  594.         //作业五区，到（11，39）做作业

  595.     {

  596.         //走到（11,39）         @@@

  597.         if (homework_11_39 == 0)

  598.         {

  599.             DoHomework(11, 39, api);

  600.             if (api.GetClassroomProgress(11, 39) >= 10000000)

  601.             {

  602.                 homework_11_39 = 1;

  603.             }

  604.         }

  605.         else

  606.         {

  607.             GetToTheNearestHomework(api);

  608.         }

  609.     }

  610.     if (((x >= 16) && (x <= 21) && (y >= 31) && (y <= 44)))

  611.         //作业六区，到（20，42）做作业

  612.     {

  613.         //走到（20,42）         @@@

  614.         if (homework_20_42 == 0)

  615.         {

  616.             DoHomework(20, 42, api);

  617.             if (api.GetClassroomProgress(20, 42) >= 10000000)

  618.             {

  619.                 homework_20_42 = 1;

  620.             }

  621.         }

  622.         else

  623.         {

  624.             GetToTheNearestHomework(api);

  625.         }

  626.     }

  627.     if (((x >= 27) && (x <= 31) && (y >= 25) && (y <= 36)))

  628.         //作业七区，到（29，27）做作业

  629.     {

  630.         //走到（29,27）         @@@

  631.         if (homework_29_27 == 0)

  632.         {

  633.             DoHomework(29, 27, api);

  634.             if (api.GetClassroomProgress(29, 27) >= 10000000)

  635.             {

  636.                 homework_29_27 = 1;

  637.             }

  638.         }

  639.         else

  640.         {

  641.             GetToTheNearestHomework(api);

  642.         }

  643.     }

  644.     if (((x >= 28) && (x <= 31) && (y >= 37) && (y <= 40)) || ((x >= 32) && (x <= 37) && (y >= 28) && (y <= 44)))

  645.         //作业八区，到（34，41）做作业

  646.     {

  647.         //走到（34,41）         @@@

  648.         if (homework_34_41 == 0)

  649.         {

  650.             DoHomework(34, 41, api);

  651.             if (api.GetClassroomProgress(34, 41) >= 10000000)

  652.             {

  653.                 homework_34_41 = 1;

  654.             }

  655.         }

  656.         else

  657.         {

  658.             GetToTheNearestHomework(api);

  659.         }

  660.     }

  661.     if (((x >= 38) && (x <= 42) && (y >= 12) && (y <= 17)) || ((x >= 32) && (x <= 42) && (y >= 18) && (y <= 27)) || ((x >= 43) && (x <= 47) && (y >= 25) && (y <= 27)))

  662.         //作业九区，到（41，13）做作业

  663.     {

  664.         //走到（41,13）         @@@

  665.         if (homework_41_13 == 0)

  666.         {

  667.             DoHomework(41, 13, api);

  668.             if (api.GetClassroomProgress(41, 13) >= 10000000)

  669.             {

  670.                 homework_41_13 = 1;

  671.             }

  672.         }

  673.         else

  674.         {

  675.             GetToTheNearestHomework(api);

  676.         }

  677.     }

  678.     if (((x >= 39) && (x <= 43) && (y >= 28) && (y <= 33)) || ((x >= 44) && (x <= 49) && (y >= 28) && (y <= 39)))

  679.         //作业十区，到（46，33）做作业

  680.     {

  681.         //走到（46,33）         @@@

  682. 

  683.         if ((homework_46_33 == 0))

  684.         {

  685.             DoHomework(46, 33, api);

  686.             if (api.GetClassroomProgress(46, 33) >= 10000000)

  687.             {

  688.                 homework_46_33 = 1;

  689.             }

  690.         }

  691.         else

  692.         {

  693.             GetToTheNearestHomework(api);

  694.         }

  695.     }

  696. }

  697. int pi = 3.1415926;

  698. void AI::play(IStudentAPI& api)

  699. {

  700.     /* 防撞墙1.0(仅作记录，插入新的寻路后可删除)

  701.     auto p = api.GetSelfInfo();

  702.       double x_grid = p->x;

  703.       double y_grid = p->y;

  704.       double pi_2 = 2 * 3.1415926;

  705.       double changeangle = 3.1415926 / 2;

  706.       int x_cell_later = x_grid / 1000 + cos(angle);

  707.       int y_cell_later = y_grid / 1000 + sin(angle);

  708.       if (api.GetPlaceType(x_cell_later, y_cell_later) != THUAI6::PlaceType::Wall)

  709.       {

  710.           api.Move(1000, angle);

  711.           if (api.GetPlaceType(x_cell_later, y_cell_later) == THUAI6::PlaceType::Window)

  712.           {

  713.               api.SkipWindow();

  714.           }

  715.       }

  716.       else angle = angle + changeangle;*/

  717. 

  718. 

  719. 

  720. 

  721.       /*作业尝试1.0，仅记录，Dohomework函数完成后可删除

  722.       auto p1 = api.GetSelfInfo();

  723.        if (flag == 0) api.MoveRight(1000);

  724.        int x1 = api.GridToCell(p1->x);

  725.        int y1 = api.GridToCell(p1->y);

  726.        auto judge = api.GetPlaceType(x1 - 1, y1);

  727.        if ((judge == THUAI6::PlaceType::ClassRoom) && (api.GetClassroomProgress(23, 19) < 10000000))

  728.        {

  729.            flag = 1;

  730.            api.StartLearning();

  731.        }

  732.        if ((judge == THUAI6::PlaceType::ClassRoom) && (api.GetClassroomProgress(23, 19) >= 10000000))

  733.        {

  734.            api.EndAllAction();

  735.            api.Wait();

  736.            api.MoveLeft(1000);

  737.        }

  738.        */

  739. 

  740.        // 公共操作

  741.     if (this->playerID == 0)

  742.     {

  743.         if (flag == 0)

  744.         {

  745.             api.MoveRight(7 * 347.22222222222222);

  746.             std::this_thread::sleep_for(std::chrono::milliseconds(347 * 7));

  747.             flag = 1;

  748.         }

  749.         if (flag == 1)

  750.         {

  751.             api.StartLearning();

  752.             std::this_thread::sleep_for(std::chrono::milliseconds(75000));

  753.             api.MoveLeft(11 * 347.22222222222222);

  754.             std::this_thread::sleep_for(std::chrono::milliseconds(12*347));

  755.             flag++;

  756.         }

  757.         if (flag == 2)

  758.         {

  759.             api.MoveDown(7 * 347.222222222222);

  760.             std::this_thread::sleep_for(std::chrono::milliseconds(7 * 347));

  761.             api.StartLearning();

  762.             std::this_thread::sleep_for(std::chrono::milliseconds(75000));

  763.             flag++;

  764.         }

  765.         if (flag == 3)

  766.         {

  767.             api.MoveUp(11 * 347.222222222222);

  768.             std::this_thread::sleep_for(std::chrono::milliseconds(11 * 347));

  769.             flag++;

  770.         }

  771.         if (flag == 4)

  772.         {

  773.             api.MoveLeft(4 * 347.222222222222);

  774.             std::this_thread::sleep_for(std::chrono::milliseconds(4 * 347));

  775.             api.StartLearning();

  776.             std::this_thread::sleep_for(std::chrono::milliseconds(75000));

  777.             flag++;

  778.         }

  779.         if (flag == 5)

  780.         {

  781.             auto p = api.GetSelfInfo();

  782.             double x_grid = p->x;

  783.             double y_grid = p->y;

  784.             double changeangle = 3.1415926 / 2;

  785.             int x_cell_later = x_grid / 1000 + cos(angle);

  786.             int y_cell_later = y_grid / 1000 + sin(angle);

  787.             if (api.GetPlaceType(x_cell_later, y_cell_later) == THUAI6::PlaceType::Land )//判断下一个方块是不是墙或者是窗户

  788.             {

  789.                 api.Move(1000, angle);

  790.             }

  791.             else angle = angle + changeangle;//转角90度

  792.         }

  793.        /* auto Trick = api.GetTrickers();

  794.         if (!Trick.empty())//如果周围有Tricker，进行躲避

  795.         {

  796.             RunAway(api);

  797.         }

  798.         if (Trick.empty())//如果没有Tricker，调用原策略，分区进行

  799.         {

  800.             auto gameinfo1 = api.GetGameInfo();

  801.             if (gameinfo1->subjectFinished < 7)

  802.             {

  803.                 PlayerCarryOut(api);

  804.             }

  805.             else

  806.             {

  807.                 //走到门（6，7）或（47，46）     @@@（选一个就好）

  808.                 PlayerCarryOut(api);

  809.             }

  810.         }*/

  811.     }

  812.     if (this->playerID == 1)

  813.     {

  814.         if (flaggg == 0)

  815.         {

  816.             api.MoveUp(10 * 347);

  817.             std::this_thread::sleep_for(std::chrono::milliseconds(3472*2));

  818.             api.MoveLeft(4 * 347);

  819.             std::this_thread::sleep_for(std::chrono::milliseconds(4 * 347));

  820.             flaggg++;

  821.         }

  822.         if (flaggg == 1)

  823.         {

  824. 

  825.             api.SkipWindow();

  826.             std::this_thread::sleep_for(std::chrono::milliseconds(3472*3));

  827.             flaggg++;

  828. 

  829.         }

  830.         if (flaggg == 2)

  831.         {

  832.             api.MoveDown(7 * 347);

  833.             std::this_thread::sleep_for(std::chrono::milliseconds(7 * 347));

  834.             flaggg++;

  835.         }

  836.         if (flaggg == 3)

  837.         {

  838.             api.StartLearning();

  839.             std::this_thread::sleep_for(std::chrono::milliseconds(75000));

  840.             api.MoveUp(9.5 * 347.2222222222);

  841.             std::this_thread::sleep_for(std::chrono::milliseconds(10 * 347));

  842.             api.MoveLeft(4 * 347);

  843.             std::this_thread::sleep_for(std::chrono::milliseconds(4 * 347));

  844.             api.StartLearning();

  845.             std::this_thread::sleep_for(std::chrono::milliseconds(75000));

  846.             flaggg++;

  847.         }

  848.         if (flaggg == 4)

  849.         {

  850.             api.MoveUp(2 * 347);

  851.             std::this_thread::sleep_for(std::chrono::milliseconds(3 * 347));

  852.             api.MoveLeft(7 * 347);

  853.             std::this_thread::sleep_for(std::chrono::milliseconds(8 * 347));

  854.             api.StartLearning();

  855.             std::this_thread::sleep_for(std::chrono::milliseconds(75000));

  856.             flaggg++;

  857.         }

  858.         if (flagg == 5)

  859.         {

  860.             auto p = api.GetSelfInfo();

  861.             double x_grid = p->x;

  862.             double y_grid = p->y;

  863.             double changeangle = 3.1415926 / 2;

  864.             int x_cell_later = x_grid / 1000 + cos(angle);

  865.             int y_cell_later = y_grid / 1000 + sin(angle);

  866.             if (api.GetPlaceType(x_cell_later, y_cell_later) == THUAI6::PlaceType::Land)//判断下一个方块是不是墙或者是窗户

  867.             {

  868.                 api.Move(1000, angle);

  869.             }

  870.             else angle = angle + changeangle;//转角90度

  871.         }

  872.         

  873. 

  874.     } // 玩家1执行操作

  875.     else if (this->playerID == 2)

  876.     {

  877.         if (flagggg == 0)

  878.         {

  879.             api.MoveDown(20 * 347.222222222222);

  880.             std::this_thread::sleep_for(std::chrono::milliseconds(25 * 347));

  881.             api.MoveRight(8 * 347.2222222222);

  882.             std::this_thread::sleep_for(std::chrono::milliseconds(8 * 347));

  883.             flagggg++;

  884.         }

  885.         if (flagggg == 1)

  886.         {

  887.             api.SkipWindow();

  888.             std::this_thread::sleep_for(std::chrono::milliseconds(3472 * 2));

  889.             api.MoveDown(6 * 347.2222222222);

  890.             std::this_thread::sleep_for(std::chrono::milliseconds(8 * 347));

  891.             api.MoveRight(14 * 347.2222222222);

  892.             std::this_thread::sleep_for(std::chrono::milliseconds(15 * 347));

  893.             api.StartLearning();

  894.             std::this_thread::sleep_for(std::chrono::milliseconds(75000));

  895.             api.MoveLeft(5 * 347.2222222222);

  896.             std::this_thread::sleep_for(std::chrono::milliseconds(6 * 347));

  897.             api.MoveUp(5 * 347.2222222222);

  898.             std::this_thread::sleep_for(std::chrono::milliseconds(6 * 347));

  899.             api.MoveLeft(14 * 347.2222222222);

  900.             std::this_thread::sleep_for(std::chrono::milliseconds(15 * 347));

  901.             api.StartLearning();

  902.             std::this_thread::sleep_for(std::chrono::milliseconds(75000));

  903.             flagggg++;

  904.         }

  905.         if (flagggg == 2)

  906.         {

  907.             auto p = api.GetSelfInfo();

  908.             double x_grid = p->x;

  909.             double y_grid = p->y;

  910.             double changeangle = 3.1415926 / 2;

  911.             int x_cell_later = x_grid / 1000 + cos(angle);

  912.             int y_cell_later = y_grid / 1000 + sin(angle);

  913.             if (api.GetPlaceType(x_cell_later, y_cell_later) == THUAI6::PlaceType::Land)//判断下一个方块是不是墙或者是窗户

  914.             {

  915.                 api.Move(1000, angle);

  916.             }

  917.             else angle = angle + changeangle;//转角90度

  918.         }

  919.         //std::this_thread::sleep_for(std::chrono::milliseconds(10000));

  920.         //MoveTo(5, 6, api, 2880, 0);

  921.         /*

  922.         double dx, dy, aa;

  923.             //std::this_thread::sleep_for(std::chrono::milliseconds(810));

  924.             dx = x-4000;

  925.             dy = y-21000;

  926.             ddx = abs(api.GridToCell(dx));

  927.             ddy = abs(api.GridToCell(dy));

  928.             c= UpLeft(ddx, ddy, x, y, api);

  929.             ii = abs(ddx) + abs(ddy) - 2;

  930.             while (ii>=0 && c[0] != 3)

  931.             {

  932.                 if (c[ii]==1)

  933.                 {

  934.                     api.MoveUp(347.222222);

  935.                     std::this_thread::sleep_for(std::chrono::milliseconds(347));

  936.                 }

  937.                 if (c[ii] == 2)

  938.                 {

  939.                     api.MoveLeft(347.222222);

  940.                     std::this_thread::sleep_for(std::chrono::milliseconds(347));

  941.                 }

  942.                 ii--;

  943.             }*/

  944.            // flag1 = 1;

  945. 

  946.         }

  947.         /*long long step;//用于记录走到目的地所需要的步骤

  948.         step = UpLeft(x_cell - 10, y_cell - 21, x_cell, y_cell, api);;

  949.         double time_ms = (1000.0 / (2880)) * 1000;

  950.         int len = x_cell - 10 + y_cell - 21-1;

  951.         if (len>0)

  952.         {

  953.             

  954.                 if (step % 10 == 0)

  955.                 {

  956.                     api.MoveUp(time_ms);

  957.                     std::this_thread::sleep_for(std::chrono::milliseconds(int(time_ms)));

  958.                 }

  959.                 else

  960.                 {

  961.                     api.MoveLeft(time_ms);

  962.                     std::this_thread::sleep_for(std::chrono::milliseconds(int(time_ms)));

  963.                 }

  964.                 step /= 10;

  965.                 len--;

  966. 

  967.         }*/// 玩家2执行操作

  968. 

  969.     else if (this->playerID == 3)

  970.     {

  971.         if (flagg == 0)

  972.         {

  973.             api.Move(3472 * 2, pi / 4.0);

  974.             std::this_thread::sleep_for(std::chrono::milliseconds(3472 * 2));

  975.             api.StartLearning();

  976.             std::this_thread::sleep_for(std::chrono::milliseconds(75000));

  977.             api.MoveUp(347 * 4.5);

  978.             std::this_thread::sleep_for(std::chrono::milliseconds(347 * 5));

  979.             flagg++;

  980.         }

  981.         if (flagg == 1)

  982.         {

  983.             api.MoveLeft(347 * 30);

  984.             std::this_thread::sleep_for(std::chrono::milliseconds(3472 * 3));

  985.             api.StartLearning();

  986.             std::this_thread::sleep_for(std::chrono::milliseconds(75000));

  987.         }

  988.         

  989.         if (flagg == 2)

  990.         {

  991.             auto p = api.GetSelfInfo();

  992.             double x_grid = p->x;

  993.             double y_grid = p->y;

  994.             double changeangle = 3.1415926 / 2;

  995.             int x_cell_later = x_grid / 1000 + cos(angle);

  996.             int y_cell_later = y_grid / 1000 + sin(angle);

  997.             if (api.GetPlaceType(x_cell_later, y_cell_later) == THUAI6::PlaceType::Land)//判断下一个方块是不是墙或者是窗户

  998.             {

  999.                 api.Move(1000, angle);

  1000.             }

  1001.             else angle = angle + changeangle;//转角90度

  1002.         }

  1003. 

  1004.     } // 玩家3执行操作

  1005.     //当然可以写成if (this->playerID == 2||this->playerID == 3)之类的操作

  1006.     // 公共操作

  1007. }

  1008. 

  1009. 

  1010. void AI::play(ITrickerAPI& api)

  1011. {

  1012.     auto self = api.GetSelfInfo();

  1013.     api.PrintSelfInfo();

  1014. }