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.
Tree: d67e7e7117
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from 'd67e7e7117'
${ noResults }
THUAI6/players/Mukava Poikaa/player2.cpp

1256 lines
44 kB
Raw Blame History 

  1. #include <vector>

  2. #include <thread>

  3. #include <array>

  4. #include "AI.h"

  5. #include "constants.h"

  6. #include <logic.h>

  7. 

  8. 

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

  10. extern const bool asynchronous = false;

  11. 

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

  13. 

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

  15.     THUAI6::StudentType::Athlete,

  16.     THUAI6::StudentType::Athlete,

  17.     THUAI6::StudentType::StraightAStudent,

  18.     THUAI6::StudentType::Sunshine };

  19. 

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

  21. 

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

  23. double LandCount = 1.0, GrassCount = 0.8, WindowCount = 0.2;

  24. int TempMap[50][50] = { 0 };//寻路过程中使用的临时地图，每次用后要清理一遍。若数值为零则该格子表示可以通行。

  25. int GrassMap[50][50] = { 0 };//草地寻路过程中的地图，0代表非草地，1代表草地

  26. double TempMapCount[50][50] = { 9999.0 };//TempMapCount标记每个可以通过的格子目前到出发点的距离权重

  27. int STempPlaceX[5];//存储0~3号学生的X坐标，单位是Cell

  28. int STempPlaceY[5];//存储0~3号学生的Y坐标，单位是Cell

  29. int SAttemptX[5];//存储0~3学生要去格子的X坐标，单位是Cell

  30. int SAttemptY[5];//存储0~3学生要去格子的Y坐标，单位是Cell

  31. int STPX[4][5];//即每个个体两个定位点的X坐标，前为四角，后为玩家序号，单位是Cell

  32. int STPXC[5];//与上一个相对是中心点X坐标，单位是Cell

  33. int STPY[4][5];//即每个个体两个定位点的Y坐标，前为四角，后为玩家序号，单位是Cell

  34. int STPYC[5];//与上一个相对是中心点Y坐标，单位是Cell

  35. int SNextX[5];//存储0~3学生下一个落脚点的X坐标，单位是Cell

  36. int SNextY[5];//存储0~3学生下一个落脚点的Y坐标，单位是Cell

  37. double LessSteps, CurrentSteps = 0.0;//分别标记目前所有可行路径中步数最少的方案步数和当前实时的步数

  38. int CurrentChoice[5] = { 1 };//（递归用）最少步数和当前步数

  39. int BestChoice;//（递归用）当前选择

  40. int NextPlaceType[5];//下一个前进方向格子种类,"0"代表陆地，“3”代表窗户

  41. int NowAction = -1;//目前正在进行的是玩家几号的代码

  42. int NowTrialDirect = 0;//目前的第一步，在firststep()函数中是每一步要换的，0、1、2、3分别代表上右下左

  43. int MoveDuring = 40, AdjustmentDuring = 25;

  44. int const HalfBall = 401;

  45. 

  46. int SMission[5] = { 0 };//学生当前任务，-1代表寻找教室（仅一瞬间），0代表前往目标点，1代表暂停在原地（学习，开门），2代表逃脱捣蛋鬼

  47. int Escaping=0;

  48. 

  49. bool GameStartFlag = false;//是否已经进行每局游戏一次的Special check

  50. int TotalDoneClass = 0;//已经完成教室总数

  51. int ScanClass[10] = { 0 };//已经完成的教室记为1

  52. int ScanClassX[10] = { 0 };

  53. int ScanClassY[10] = { 0 };

  54. int TargetClass[4] = { 0 };

  55. int TargetGate[4] = { 0 };

  56. int ScanGate[2] = { 0 };

  57. int ScanGateX[2] = { 0 };

  58. int ScanGateY[2] = { 0 };

  59. int GateOpen[3] = { 0 };

  60. int MissionStorage=237159;

  61. 

  62. int StartGrad[4] = { 0 };

  63. //此区域定义Students所见Tricker信息

  64. int TrickerType;

  65. int TrickerLastWitness[2];

  66. //监管者

  67. 

  68. 

  69. 

  70. //向前声明区

  71. void trialstep(int f, int g);//向前声明每一步的尝试

  72. void trialstepForRoom(int f, int g);

  73. void trialstepForGrad(int f, int g);

  74. void SCheckTricker(IStudentAPI& api);

  75. void trialstepForGrass(int f, int g);

  76. void trialstepForTRoom(int f, int g);

  77. 

  78. 

  79. //逃生者函数区

  80. int NextStep()//判断下一格格式

  81. {

  82.     if (CurrentChoice[NowAction] == 0)

  83.     {

  84.         SNextX[NowAction] = STempPlaceX[NowAction] - 1;

  85.         SNextY[NowAction] = STempPlaceY[NowAction];

  86.     }

  87.     if (CurrentChoice[NowAction] == 1)

  88.     {

  89.         SNextX[NowAction] = STempPlaceX[NowAction];

  90.         SNextY[NowAction] = STempPlaceY[NowAction] + 1;

  91. 

  92.     }

  93.     if (CurrentChoice[NowAction] == 2)

  94.     {

  95.         SNextX[NowAction] = STempPlaceX[NowAction] + 1;

  96.         SNextY[NowAction] = STempPlaceY[NowAction];

  97.     }

  98.     if (CurrentChoice[NowAction] == 3)

  99.     {

  100.         SNextX[NowAction] = STempPlaceX[NowAction];

  101.         SNextY[NowAction] = STempPlaceY[NowAction] - 1;

  102.     }

  103.     NextPlaceType[NowAction] = TempMap[SNextX[NowAction]][SNextY[NowAction]];

  104.     return 0;

  105. }

  106. int firststep(int f, int g)//寻路的第一步，单独分出来的原因是我们的目的就是下一步的位置

  107. {

  108.     if (f < 0 || f>49 || g < 0 || g>49) {

  109.         return 0;

  110.     }

  111.     else

  112.     {

  113.         for (int i = 0; i < 50; i++)

  114.         {

  115.             for (int j = 0; j < 50; j++)

  116.             {

  117.                 TempMapCount[i][j] = 9999.0;

  118.             }

  119.         }

  120.         NextPlaceType[NowAction] = 3;

  121.         CurrentChoice[NowAction] = 5;//Test

  122.         TempMap[f][g] = 1;

  123.         CurrentSteps = 0.0;//初始化现在步数

  124.         LessSteps = 9999.0;//初始化当前寻路过程的最少步数    

  125.         NowTrialDirect = 0;//尝试向上的所有分支

  126.         trialstep((f - 1), g);

  127.         CurrentSteps = 0.0;

  128.         NowTrialDirect = 1;//尝试向右的所有分支

  129.         trialstep((f), (g + 1));

  130.         CurrentSteps = 0.0;

  131.         NowTrialDirect = 2;//尝试向下的所有分支

  132.         trialstep((f + 1), g);

  133.         TempMap[f][g] = 0;

  134.         NowTrialDirect = 3;//尝试向左的所有分支

  135.         trialstep(f, (g - 1));

  136.         CurrentSteps = 0.0;

  137.         NextStep();

  138.         if (LessSteps < 9999.0) { return CurrentChoice[NowAction]; }

  139.         else return 0;

  140.     }

  141. }

  142. void trialstep(int f, int g)//用于一步步测试，该函数使用了递归

  143. {

  144. 

  145.     if (f < 0 || f>49 || g < 0 || g>49) { return; }//如果越界，直接结束该分支

  146.     else

  147.     {

  148.         if (TempMap[f][g] == 1 || TempMap[f][g] == 4) {}//如果临时地图TempMap上（f，g）不可移动：直接结束该分支

  149.         else//说明这边至少是可以走的，进行下一步尝试

  150.         {

  151.             if ((CurrentSteps + LandCount) < TempMapCount[f][g])

  152.             {

  153.                 CurrentSteps += LandCount;

  154.                 TempMapCount[f][g] = CurrentSteps;

  155.                 if (f == SAttemptX[NowAction] && g == SAttemptY[NowAction])//原checkstep函数改换至此

  156.                 {

  157.                     if (CurrentSteps < LessSteps) { LessSteps = CurrentSteps; CurrentChoice[NowAction] = NowTrialDirect; }

  158.                 }

  159.                 else

  160.                 {

  161.                     TempMap[f][g] ++;

  162.                     trialstep((f - 1), g);

  163.                     trialstep((f), (g + 1));

  164.                     trialstep((f + 1), g);

  165.                     trialstep(f, (g - 1));

  166.                     TempMap[f][g] --;

  167.                 }

  168.                 CurrentSteps -= LandCount;

  169.             }

  170.         }

  171.     }

  172.     return;

  173. }

  174. void LandMove(IStudentAPI& api)

  175. {

  176.     if ((STempPlaceX[NowAction] != SAttemptX[NowAction]) || (STempPlaceY[NowAction] != SAttemptY[NowAction]))

  177.     {

  178.         if (CurrentChoice[NowAction] == 0) { api.Move(MoveDuring, 3.14); }

  179.         if (CurrentChoice[NowAction] == 1) { api.Move(MoveDuring, 1.57); }

  180.         if (CurrentChoice[NowAction] == 2) { api.Move(MoveDuring, 0); }

  181.         if (CurrentChoice[NowAction] == 3) { api.Move(MoveDuring, 4.71); }

  182.     }

  183. }

  184. 

  185. void BallLocate(IStudentAPI& api)

  186. {

  187.     STPXC[NowAction] = api.GridToCell(api.GetSelfInfo()->x);

  188.     STPYC[NowAction] = api.GridToCell(api.GetSelfInfo()->y);

  189.     STPX[0][NowAction] = api.GridToCell(api.GetSelfInfo()->x - HalfBall);//0号左上

  190.     STPY[0][NowAction] = api.GridToCell(api.GetSelfInfo()->y - HalfBall);

  191.     STPX[1][NowAction] = api.GridToCell(api.GetSelfInfo()->x + HalfBall);//1号右下

  192.     STPY[1][NowAction] = api.GridToCell(api.GetSelfInfo()->y + HalfBall);

  193.     STPX[2][NowAction] = api.GridToCell(api.GetSelfInfo()->x - HalfBall);//2号右上

  194.     STPY[2][NowAction] = api.GridToCell(api.GetSelfInfo()->y + HalfBall);

  195.     STPX[3][NowAction] = api.GridToCell(api.GetSelfInfo()->x + HalfBall);//3号左下

  196.     STPY[3][NowAction] = api.GridToCell(api.GetSelfInfo()->y - HalfBall);

  197. }

  198. void RoadDirectionMove(IStudentAPI& api)//寻路系统

  199. {

  200.     BallLocate(api);

  201.     if ((STPX[1][NowAction] == STPX[0][NowAction]) && (STPY[1][NowAction] == STPY[0][NowAction]))//确定整个在同一个格子内

  202.     {

  203.         STempPlaceX[NowAction] = STPXC[NowAction]; STempPlaceY[NowAction] = STPYC[NowAction];

  204.     }

  205.     if (TempMap[STPX[0][NowAction]][STPY[0][NowAction]] == 1)//若偏离，补救措施

  206.     {

  207.         api.Move(AdjustmentDuring, 0.785);

  208.     }

  209.     else if (TempMap[STPX[1][NowAction]][STPY[1][NowAction]] == 1)

  210.     {

  211.         api.Move(AdjustmentDuring, 3.925);

  212.     }

  213.     else if (TempMap[STPX[2][NowAction]][STPY[2][NowAction]] == 1)

  214.     {

  215.         api.Move(AdjustmentDuring, 5.495);

  216.     }

  217.     else if (TempMap[STPX[1][NowAction]][STPY[1][NowAction]] == 1)

  218.     {

  219.         api.Move(AdjustmentDuring, 2.395);

  220.     }

  221.     else

  222.     {

  223.         firststep((STempPlaceX[NowAction]), (STempPlaceY[NowAction]));

  224.         NextStep();

  225.         if (NextPlaceType[NowAction] == 0) { LandMove(api); }

  226.         else if (NextPlaceType[NowAction] == 3)

  227.         {

  228.             api.SkipWindow();

  229.         }

  230.     }

  231. 

  232.     //else {LandMove(api); }//For Debug

  233. }//寻路

  234. 

  235. void GetStudentInSight(IStudentAPI& api)

  236. {

  237.     int NumID = 0;

  238.     for (int i = 0; i < 4; i++)

  239.     {

  240.         NumID = api.GetStudents()[i]->playerID;

  241.         int TempX = api.GetStudents()[i]->x;

  242.         int TempY = api.GetStudents()[i]->y;

  243.         STPXC[NumID] = api.GridToCell(TempX);

  244.         STPYC[NumID] = api.GridToCell(TempY);

  245.         STPX[0][NumID] = api.GridToCell(TempX - HalfBall);

  246.         STPY[0][NumID] = api.GridToCell(TempY - HalfBall);

  247.         STPX[1][NumID] = api.GridToCell(TempX + HalfBall);

  248.         STPY[1][NumID] = api.GridToCell(TempY + HalfBall);

  249.         STPX[2][NumID] = api.GridToCell(TempX - HalfBall);

  250.         STPY[2][NumID] = api.GridToCell(TempY + HalfBall);

  251.         STPX[3][NumID] = api.GridToCell(TempX + HalfBall);

  252.         STPY[3][NumID] = api.GridToCell(TempY - HalfBall);

  253.     }

  254. }

  255. 

  256. int firststepForRoom(int f, int g)//寻路的第一步，单独分出来的原因是我们的目的就是下一步的位置

  257. {

  258.     if (f < 0 || f>49 || g < 0 || g>49) {

  259.         return 0;

  260.     }

  261.     else

  262.     {

  263.         for (int i = 0; i < 50; i++)

  264.         {

  265.             for (int j = 0; j < 50; j++)

  266.             {

  267.                 TempMapCount[i][j] = 9999.0;

  268.             }

  269.         }

  270.         NextPlaceType[NowAction] = 3;

  271.         CurrentChoice[NowAction] = 5;//Test

  272.         TempMap[f][g] = 1;

  273.         CurrentSteps = 0.0;//初始化现在步数

  274.         LessSteps = 9999.0;//初始化当前寻路过程的最少步数    

  275.         NowTrialDirect = 0;//尝试向上的所有分支

  276.         trialstepForRoom((f - 1), g);

  277.         CurrentSteps = 0.0;

  278.         NowTrialDirect = 1;//尝试向右的所有分支

  279.         trialstepForRoom((f), (g + 1));

  280.         CurrentSteps = 0.0;

  281.         NowTrialDirect = 2;//尝试向下的所有分支

  282.         trialstepForRoom((f + 1), g);

  283.         TempMap[f][g] = 0;

  284.         NowTrialDirect = 3;//尝试向左的所有分支

  285.         trialstepForRoom(f, (g - 1));

  286.         CurrentSteps = 0.0;

  287.         NextStep();

  288.         if (LessSteps < 9999.0) { return CurrentChoice[NowAction]; }

  289.         else return 0;

  290.     }

  291. }

  292. void trialstepForRoom(int f, int g)//用于一步步测试，该函数使用了递归

  293. {

  294.     int FinalFlag = 0;

  295.     if (f < 0 || f>49 || g < 0 || g>49) { return; }//如果越界，直接结束该分支

  296.     else

  297.     {

  298.         if (TempMap[f][g] == 1 || TempMap[f][g] == 4) {}//如果临时地图TempMap上（f，g）不可移动：直接结束该分支

  299.         else//说明这边至少是可以走的，进行下一步尝试

  300.         {

  301.             if ((CurrentSteps + LandCount) < TempMapCount[f][g])

  302.             {

  303.                 CurrentSteps += LandCount;

  304.                 TempMapCount[f][g] = CurrentSteps;

  305.                 for (int i = 0; i < 10; i++)

  306.                 {

  307.                     if (f == ScanClassX[i] && g == ScanClassY[i] && ScanClass[i] == 0)//原checkstep函数改换至此

  308.                     {

  309.                         FinalFlag = 1;

  310.                         if (CurrentSteps < LessSteps)

  311.                         {

  312.                             LessSteps = CurrentSteps;

  313.                             CurrentChoice[NowAction] = NowTrialDirect;

  314.                             TargetClass[NowAction] = i;//这暂时是必要的，因为后期要写这个教室被完成了

  315.                             SAttemptX[NowAction] = f;

  316.                             SAttemptX[NowAction] = g;

  317.                         }

  318.                     }

  319.                 }

  320.                 if (FinalFlag == 0)

  321.                 {

  322.                     TempMap[f][g] ++;

  323.                     trialstepForRoom((f - 1), g);

  324.                     trialstepForRoom((f), (g + 1));

  325.                     trialstepForRoom((f + 1), g);

  326.                     trialstepForRoom(f, (g - 1));

  327.                     TempMap[f][g] --;

  328.                 }

  329.                 FinalFlag = 0;

  330.                 CurrentSteps -= LandCount;

  331.             }

  332.         }

  333.     }

  334.     return;

  335. }

  336. void RoadDirectionMoveForRoom(IStudentAPI& api)//寻路系统

  337. {

  338.     BallLocate(api);

  339.     //if ((STPX[1][NowAction] == STPX[0][NowAction]) && (STPY[1][NowAction] == STPY[0][NowAction]))//确定整个在同一个格子内

  340.     {

  341.         STempPlaceX[NowAction] = STPXC[NowAction]; STempPlaceY[NowAction] = STPYC[NowAction];

  342.     }

  343.     if (TempMap[STPX[0][NowAction]][STPY[0][NowAction]] == 1 || TempMap[STPX[0][NowAction]][STPY[0][NowAction]] == 4)//若偏离，补救措施

  344.     {

  345.         api.Move(AdjustmentDuring, 0.786);

  346.     }

  347.     else if (TempMap[STPX[1][NowAction]][STPY[1][NowAction]] == 1 || TempMap[STPX[1][NowAction]][STPY[1][NowAction]] == 4)

  348.     {

  349.         api.Move(AdjustmentDuring, 3.925);

  350.     }

  351.     else if (TempMap[STPX[2][NowAction]][STPY[2][NowAction]] == 1 || TempMap[STPX[2][NowAction]][STPY[2][NowAction]] == 4)

  352.     {

  353.         api.Move(AdjustmentDuring, 5.495);

  354.     }

  355.     else if (TempMap[STPX[3][NowAction]][STPY[3][NowAction]] == 1 || TempMap[STPX[3][NowAction]][STPY[3][NowAction]] == 4)

  356.     {

  357.         api.Move(AdjustmentDuring, 2.395);

  358.     }

  359.     else

  360.     {

  361.         firststepForRoom((STempPlaceX[NowAction]), (STempPlaceY[NowAction]));

  362.         NextStep();

  363.         if (NextPlaceType[NowAction] == 0) { LandMove(api); }

  364.         else if (NextPlaceType[NowAction] == 3)

  365.         {

  366.             api.SkipWindow();

  367.         }

  368.     }

  369. 

  370.     //else {LandMove(api); }//For Debug

  371. }//寻路

  372. 

  373. int firststepForGrass(int f, int g)//寻路的第一步，单独分出来的原因是我们的目的就是下一步的位置

  374. {

  375.     if (f < 0 || f>49 || g < 0 || g>49) {

  376.         return 0;

  377.     }

  378.     else

  379.     {

  380.         for (int i = 0; i < 50; i++)

  381.         {

  382.             for (int j = 0; j < 50; j++)

  383.             {

  384.                 TempMapCount[i][j] = 9999.0;

  385.             }

  386.         }

  387.         NextPlaceType[NowAction] = 3;

  388.         CurrentChoice[NowAction] = 5;//Test

  389.         TempMap[f][g] = 1;

  390.         CurrentSteps = 0.0;//初始化现在步数

  391.         LessSteps = 9999.0;//初始化当前寻路过程的最少步数    

  392.         NowTrialDirect = 0;//尝试向上的所有分支

  393.         trialstepForGrass((f - 1), g);

  394.         CurrentSteps = 0.0;

  395.         NowTrialDirect = 1;//尝试向右的所有分支

  396.         trialstepForGrass((f), (g + 1));

  397.         CurrentSteps = 0.0;

  398.         NowTrialDirect = 2;//尝试向下的所有分支

  399.         trialstepForGrass((f + 1), g);

  400.         TempMap[f][g] = 0;

  401.         NowTrialDirect = 3;//尝试向左的所有分支

  402.         trialstepForGrass(f, (g - 1));

  403.         CurrentSteps = 0.0;

  404.         NextStep();

  405.         if (LessSteps < 9999.0) { return CurrentChoice[NowAction]; }

  406.         else return 0;

  407.     }

  408. }

  409. void trialstepForGrass(int f, int g)//用于一步步测试，该函数使用了递归

  410. {

  411.     int FinalFlag = 0;

  412.     if (f < 0 || f>49 || g < 0 || g>49) { return; }//如果越界，直接结束该分支

  413.     else

  414.     {

  415.         if (TempMap[f][g] == 1 || TempMap[f][g] == 4) {}//如果临时地图TempMap上（f，g）不可移动：直接结束该分支

  416.         else//说明这边至少是可以走的，进行下一步尝试

  417.         {

  418.             if ((CurrentSteps + LandCount) < TempMapCount[f][g])

  419.             {

  420.                 CurrentSteps += LandCount;

  421.                 TempMapCount[f][g] = CurrentSteps;

  422.                 for (int i = 0; i < 10; i++)

  423.                 {

  424.                     if (GrassMap[f][g]==1)//原checkstep函数改换至此

  425.                     {

  426.                         FinalFlag = 1;

  427.                         if (CurrentSteps < LessSteps)

  428.                         {

  429.                             LessSteps = CurrentSteps;

  430.                             CurrentChoice[NowAction] = NowTrialDirect;

  431.                             TargetClass[NowAction] = i;//这暂时是必要的，因为后期要写这个教室被完成了

  432.                             SAttemptX[NowAction] = f;

  433.                             SAttemptX[NowAction] = g;

  434.                         }

  435.                     }

  436.                 }

  437.                 if (FinalFlag == 0)

  438.                 {

  439.                     TempMap[f][g] ++;

  440.                     trialstepForGrass((f - 1), g);

  441.                     trialstepForGrass((f), (g + 1));

  442.                     trialstepForGrass((f + 1), g);

  443.                     trialstepForGrass(f, (g - 1));

  444.                     TempMap[f][g] --;

  445.                 }

  446.                 FinalFlag = 0;

  447.                 CurrentSteps -= LandCount;

  448.             }

  449.         }

  450.     }

  451.     return;

  452. }

  453. void RoadDirectionMoveForGrass(IStudentAPI& api)//寻路系统

  454. {

  455.     BallLocate(api);

  456.     //if ((STPX[1][NowAction] == STPX[0][NowAction]) && (STPY[1][NowAction] == STPY[0][NowAction]))//确定整个在同一个格子内

  457.     {

  458.         STempPlaceX[NowAction] = STPXC[NowAction]; STempPlaceY[NowAction] = STPYC[NowAction];

  459.     }

  460.     if (TempMap[STPX[0][NowAction]][STPY[0][NowAction]] == 1 || TempMap[STPX[0][NowAction]][STPY[0][NowAction]] == 4)//若偏离，补救措施

  461.     {

  462.         api.Move(AdjustmentDuring, 0.786);

  463.     }

  464.     else if (TempMap[STPX[1][NowAction]][STPY[1][NowAction]] == 1 || TempMap[STPX[1][NowAction]][STPY[1][NowAction]] == 4)

  465.     {

  466.         api.Move(AdjustmentDuring, 3.925);

  467.     }

  468.     else if (TempMap[STPX[2][NowAction]][STPY[2][NowAction]] == 1 || TempMap[STPX[2][NowAction]][STPY[2][NowAction]] == 4)

  469.     {

  470.         api.Move(AdjustmentDuring, 5.495);

  471.     }

  472.     else if (TempMap[STPX[3][NowAction]][STPY[3][NowAction]] == 1 || TempMap[STPX[3][NowAction]][STPY[3][NowAction]] == 4)

  473.     {

  474.         api.Move(AdjustmentDuring, 2.395);

  475.     }

  476.     else

  477.     {

  478.         firststepForGrass((STempPlaceX[NowAction]), (STempPlaceY[NowAction]));

  479.         NextStep();

  480.         if (NextPlaceType[NowAction] == 0) { LandMove(api); }

  481.         else if (NextPlaceType[NowAction] == 3)

  482.         {

  483.             api.SkipWindow();

  484.         }

  485.     }

  486. 

  487.     //else {LandMove(api); }//For Debug

  488. }//寻路

  489. 

  490. int firststepForGrad(int f, int g)//寻路的第一步，单独分出来的原因是我们的目的就是下一步的位置

  491. {

  492.     if (f < 0 || f>49 || g < 0 || g>49) {

  493.         return 0;

  494.     }

  495.     else

  496.     {

  497.         for (int i = 0; i < 50; i++)

  498.         {

  499.             for (int j = 0; j < 50; j++)

  500.             {

  501.                 TempMapCount[i][j] = 9999.0;

  502.             }

  503.         }

  504.         NextPlaceType[NowAction] = 3;

  505.         CurrentChoice[NowAction] = 5;//Test

  506.         TempMap[f][g] = 1;

  507.         CurrentSteps = 0.0;//初始化现在步数

  508.         LessSteps = 9999.0;//初始化当前寻路过程的最少步数    

  509.         NowTrialDirect = 0;//尝试向上的所有分支

  510.         trialstepForGrad((f - 1), g);

  511.         CurrentSteps = 0.0;

  512.         NowTrialDirect = 1;//尝试向右的所有分支

  513.         trialstepForGrad((f), (g + 1));

  514.         CurrentSteps = 0.0;

  515.         NowTrialDirect = 2;//尝试向下的所有分支

  516.         trialstepForGrad((f + 1), g);

  517.         TempMap[f][g] = 0;

  518.         NowTrialDirect = 3;//尝试向左的所有分支

  519.         trialstepForGrad(f, (g - 1));

  520.         CurrentSteps = 0.0;

  521.         NextStep();

  522.         if (LessSteps < 9999.0) { return CurrentChoice[NowAction]; }

  523.         else return 0;

  524.     }

  525. }

  526. void trialstepForGrad(int f, int g)//用于一步步测试，该函数使用了递归

  527. {

  528.     int FinalFlag = 0;

  529.     if (f < 0 || f>49 || g < 0 || g>49) { return; }//如果越界，直接结束该分支

  530.     else

  531.     {

  532.         if (TempMap[f][g] == 1 || TempMap[f][g] == 4) {}//如果临时地图TempMap上（f，g）不可移动：直接结束该分支

  533.         else//说明这边至少是可以走的，进行下一步尝试

  534.         {

  535.             if ((CurrentSteps + LandCount) < TempMapCount[f][g])

  536.             {

  537.                 CurrentSteps += LandCount;

  538.                 TempMapCount[f][g] = CurrentSteps;

  539.                 for (int i = 0; i < 10; i++)

  540.                 {

  541.                     if (f == ScanGateX[i] && g == ScanGateY[i] && ScanGate[i] == 0)//原checkstep函数改换至此

  542.                     {

  543.                         FinalFlag = 1;

  544.                         if (CurrentSteps < LessSteps)

  545.                         {

  546.                             LessSteps = CurrentSteps;

  547.                             CurrentChoice[NowAction] = NowTrialDirect;

  548.                             TargetGate[NowAction] = i;//这暂时是必要的，因为后期要写这个Gate被完成了

  549.                             SAttemptX[NowAction] = f;

  550.                             SAttemptX[NowAction] = g;

  551.                         }

  552.                     }

  553.                 }

  554.                 if (FinalFlag == 0)

  555.                 {

  556.                     TempMap[f][g] ++;

  557.                     trialstepForGrad((f - 1), g);

  558.                     trialstepForGrad((f), (g + 1));

  559.                     trialstepForGrad((f + 1), g);

  560.                     trialstepForGrad(f, (g - 1));

  561.                     TempMap[f][g] --;

  562.                 }

  563.                 FinalFlag = 0;

  564.                 CurrentSteps -= LandCount;

  565.             }

  566.         }

  567.     }

  568.     return;

  569. }

  570. void RoadDirectionMoveForGrad(IStudentAPI& api)//寻路系统

  571. {

  572.     BallLocate(api);

  573.     //if ((STPX[1][NowAction] == STPX[0][NowAction]) && (STPY[1][NowAction] == STPY[0][NowAction]))//确定整个在同一个格子内

  574.     {

  575.         STempPlaceX[NowAction] = STPXC[NowAction]; STempPlaceY[NowAction] = STPYC[NowAction];

  576.     }

  577.     if (TempMap[STPX[0][NowAction]][STPY[0][NowAction]] == 1 || TempMap[STPX[0][NowAction]][STPY[0][NowAction]] == 4)//若偏离，补救措施

  578.     {

  579.         api.Move(AdjustmentDuring, 0.786);

  580.     }

  581.     else if (TempMap[STPX[1][NowAction]][STPY[1][NowAction]] == 1 || TempMap[STPX[1][NowAction]][STPY[1][NowAction]] == 4)

  582.     {

  583.         api.Move(AdjustmentDuring, 3.925);

  584.     }

  585.     else if (TempMap[STPX[2][NowAction]][STPY[2][NowAction]] == 1 || TempMap[STPX[2][NowAction]][STPY[2][NowAction]] == 4)

  586.     {

  587.         api.Move(AdjustmentDuring, 5.495);

  588.     }

  589.     else if (TempMap[STPX[3][NowAction]][STPY[3][NowAction]] == 1 || TempMap[STPX[3][NowAction]][STPY[3][NowAction]] == 4)

  590.     {

  591.         api.Move(AdjustmentDuring, 2.395);

  592.     }

  593.     else

  594.     {

  595.         firststepForGrad((STempPlaceX[NowAction]), (STempPlaceY[NowAction]));

  596.         NextStep();

  597.         if (NextPlaceType[NowAction] == 0) { LandMove(api); }

  598.         else if (NextPlaceType[NowAction] == 3)

  599.         {

  600.             api.SkipWindow();

  601.         }

  602.     }

  603. 

  604.     //else {LandMove(api); }//For Debug

  605. }//寻路

  606. 

  607. void MapClear(IStudentAPI& api)

  608. {

  609.     GetStudentInSight(api);

  610.     for (int i = 0; i < 50; i++)//设置临时地图

  611.     {

  612.         for (int j = 0; j < 50; j++)

  613.         {

  614.             for (int k = 0; k < 4; k++)

  615.             {

  616.                 if (k != NowAction)

  617.                 {

  618.                     if (i == STempPlaceX[k] && j == STempPlaceY[k]) { TempMap[i][j] = 4; }

  619.                     if (i == STPX[0][k] && j == STPY[0][k]) { TempMap[i][j] = 4; }

  620.                     if (i == STPX[1][k] && j == STPY[1][k]) { TempMap[i][j] = 4; }

  621.                     if (i == STPX[2][k] && j == STPY[2][k]) { TempMap[i][j] = 4; }

  622.                     if (i == STPX[3][k] && j == STPY[3][k]) { TempMap[i][j] = 4; }

  623.                 }

  624.             }

  625.             if (api.GetPlaceType(i, j) == THUAI6::PlaceType::Wall || api.GetPlaceType(i, j) == THUAI6::PlaceType::Chest || api.GetPlaceType(i, j) == THUAI6::PlaceType::ClassRoom) //（i，j不属于草地也不属于陆地）

  626.             {

  627.                 TempMap[i][j] = 1;

  628.             }

  629.             if (api.GetPlaceType(i, j) == THUAI6::PlaceType::Window) //（i，j）属于窗户

  630.             {

  631.                 TempMap[i][j] = 3;

  632.             }

  633.         }

  634.     }

  635.     for (int i = 0; i < 50; i++)

  636.     {

  637.         for (int j = 0; j < 50; j++)

  638.         {

  639.             TempMapCount[i][j] = 9999.0;

  640.         }

  641.     }

  642.     return;

  643. }

  644. void MapReset()

  645. {

  646.     for (int i = 0; i < 50; i++)//清空临时地图,每个格子都记成0（可以自由行动的）

  647.     {

  648.         for (int j = 0; j < 50; j++)

  649.         {

  650.             TempMap[i][j] = 0;

  651.         }

  652.     }

  653. }

  654. 

  655. void SpecialMapCheck(IStudentAPI& api)

  656. {

  657.     int TotalNumber1 = 0;

  658.     int TotalNumber2 = 0;

  659.     if (GameStartFlag == true) {}

  660.     else

  661.     {

  662.         for (int i = 0; i < 50; i++)

  663.         {

  664.             for (int j = 0; j < 50; j++)

  665.             {

  666.                 if (api.GetPlaceType(i, j) == THUAI6::PlaceType::ClassRoom)

  667.                 {

  668.                     ScanClassX[TotalNumber1] = i;

  669.                     ScanClassY[TotalNumber1] = j;

  670.                     TotalNumber1++;

  671.                 }

  672.                 if (api.GetPlaceType(i, j) == THUAI6::PlaceType::Gate)

  673.                 {

  674.                     ScanGateX[TotalNumber2] = i;

  675.                     ScanGateY[TotalNumber2] = j;

  676.                     TotalNumber2++;

  677.                 }

  678.                 if (api.GetPlaceType(i, j) == THUAI6::PlaceType::Grass)

  679.                 {

  680.                     GrassMap[i][j] = 1;

  681.                 }

  682.             }

  683.         }

  684.     }

  685.     return;

  686. }

  687. void GameStartSettings(IStudentAPI& api)

  688. {

  689.     SpecialMapCheck(api);

  690.     SMission[0] = -1;

  691.     SMission[1] = -1;

  692.     SMission[2] = -1;

  693.     SMission[3] = -1;

  694.     GameStartFlag = true;

  695. }

  696. 

  697. void MissionCheck(IStudentAPI& api)//随时检查当前任务状态

  698. {

  699.     SCheckTricker(api);

  700.     if (Escaping == 1)

  701.     {

  702.         SMission[NowAction] = 4;

  703.     }

  704.     if(SMission[NowAction] == 4&&GrassMap[STPXC[NowAction]][STPYC[NowAction]]==1)

  705.     {

  706.         SMission[NowAction] = MissionStorage;

  707.         MissionStorage = 237159;

  708.         Escaping = 0;

  709.         printf("Stop Escaping!");

  710.     }

  711.     if (SMission[NowAction] == -1)//正在寻找教室，此时要把教室在临时地图中设置为可以行走，否则寻路无法进行

  712.     {

  713.         for (int i = 0; i < 10; i++)

  714.         {

  715.             if (ScanClass[i] == 0)

  716.             {

  717.                 TempMap[ScanClassX[i]][ScanClassY[i]] = 0;

  718.             }

  719.         }

  720.         //if ((abs(api.GetSelfInfo()->x - api.CellToGrid(ScanClassX[TargetClass[NowAction]])) + abs(api.GetSelfInfo()->y - api.CellToGrid(ScanClassX[TargetClass[NowAction]])))<= 2000)

  721.         if (((abs(STPXC[NowAction] - ScanClassX[TargetClass[NowAction]])) + abs(STPYC[NowAction] - ScanClassY[TargetClass[NowAction]])) <= 1)

  722.         {

  723.             SMission[NowAction] = 1;

  724.         }

  725.     }

  726.     if (SMission[NowAction] == -2)//正在寻找Gate，此时要把Gate在临时地图中设置为可以行走，否则寻路无法进行

  727.     {

  728.         for (int i = 0; i < 10; i++)

  729.         {

  730.             if (ScanGate[i] == 0)

  731.             {

  732.                 TempMap[ScanGateX[i]][ScanGateY[i]] = 0;

  733.             }

  734.         }

  735.         if (((abs(STPXC[NowAction] - ScanGateX[TargetGate[NowAction]])) + abs(STPYC[NowAction] - ScanGateY[TargetGate[NowAction]])) <= 1)

  736.         {

  737.             SMission[NowAction] = 2;

  738.         }

  739.     }

  740.     if (SMission[NowAction] == 1)//此状态时刻准备开始学习

  741.     {

  742.         if (api.GetSelfInfo()->playerState != THUAI6::PlayerState::Learning)

  743.         {

  744.             api.StartLearning();

  745.         }

  746.         if (api.GetClassroomProgress(ScanClassX[TargetClass[NowAction]], ScanClassY[TargetClass[NowAction]]) == Constants::maxClassroomProgress)

  747.         {

  748.             ScanClass[TargetClass[NowAction]] = 1;

  749.             SMission[NowAction] = -1;

  750.             std::string str1 = "ILoveTHU";

  751.             str1[0] = 0;//代表“0”

  752.             str1[1] = 1;//"1"

  753.             str1[6] = TargetClass[NowAction];

  754.             for (int i = 0; i < 4; i++)

  755.             {

  756.                 api.SendTextMessage(i, str1);

  757.             }

  758.         }

  759.     }

  760.     if (SMission[NowAction] == 2)

  761.     {

  762.         if (api.GetSelfInfo()->playerState != THUAI6::PlayerState::OpeningAGate)

  763.         {

  764.             api.StartOpenGate();

  765.         }

  766.         if (api.GetGateProgress(ScanGateX[TargetGate[NowAction]], ScanGateY[TargetGate[NowAction]]) == Constants::maxGateProgress)

  767.         {

  768.             ScanGate[TargetGate[NowAction]] = 1;

  769.             SMission[NowAction] = 3;

  770.             std::string str1 = "ILoveTHU!";

  771.             str1[0] = 0;//代表“0”

  772.             str1[1] = 2;//"2"

  773.             str1[3] = ScanGateX[TargetGate[NowAction]];

  774.             str1[5] = ScanGateY[TargetGate[NowAction]];

  775.             str1[6] = TargetGate[NowAction];

  776.             for (int i = 0; i < 4; i++)

  777.             {

  778.                 api.SendTextMessage(i, str1);

  779. 

  780.             }

  781.         }

  782.     }

  783.     if (SMission[NowAction] == 3)

  784.     {

  785.         api.Graduate();

  786.     }

  787.     if (TotalDoneClass >= 7 && GateOpen[0] == 0)

  788.     {

  789.         SMission[NowAction] = -2;

  790.         StartGrad[NowAction] = 1;

  791.         if (((abs(STPXC[NowAction] - ScanGateX[TargetGate[NowAction]])) + abs(STPYC[NowAction] - ScanGateY[TargetGate[NowAction]])) <= 1)

  792.         {

  793.             SMission[NowAction] = 2;

  794.             api.StartOpenGate();

  795.             api.Graduate();

  796.         }

  797.     }

  798.     if (GateOpen[0] == 1)

  799.     {

  800.         SMission[NowAction] = 3;

  801.     }

  802. }

  803. int ClassroomCheck(IStudentAPI& api)

  804. {

  805.     int TotalNum = 0;

  806.     for (int i = 0; i < 10; i++)

  807.     {

  808.         if (ScanClass[i] == 1)

  809.         {

  810.             TotalNum++;

  811.         }

  812.     }

  813.     return TotalNum;

  814. }

  815. 

  816. void SGetMessage(IStudentAPI& api)

  817. {

  818.     if (api.HaveMessage() == true)

  819.     {

  820.         std::string str1 = api.GetMessage().second;

  821.         int ID = api.GetMessage().first;

  822.         if (str1[0] == 0 && str1[1] == 1)

  823.         {

  824.             int ClassFixed = str1[6];

  825.             ScanClass[ClassFixed] = 1;

  826.             std::cout << "Get Message" << ClassFixed << "\n";

  827.         }

  828.         if (str1[0] == 0 && str1[1] == 2)

  829.         {

  830.             int GateFixed = str1[6];

  831.             ScanGate[GateFixed] = 1;

  832.             std::cout << "Get Message" << GateFixed << "\n";

  833.         }

  834.     }

  835. }

  836. void SAction(IStudentAPI& api)

  837. {

  838.     if (SMission[NowAction] == -1)

  839.     {

  840.         RoadDirectionMoveForRoom(api);

  841.     }

  842.     if (SMission[NowAction] == -2 || SMission[NowAction] == 3)

  843.     {

  844.         RoadDirectionMoveForGrad(api);

  845.     }

  846.     if (SMission[NowAction] == 4)

  847.     {

  848.         RoadDirectionMoveForGrass(api);

  849.     }

  850. }

  851. //Student与检查Tricker踪迹相关的函数

  852. void SCheckTricker(IStudentAPI& api)

  853. {

  854.     if (api.GetTrickers().empty()==false)

  855.     {

  856.         printf("GetTricker!\n");

  857.         if (SMission[NowAction] != 4)

  858.         {

  859.             MissionStorage = SMission[NowAction];

  860.         }

  861.         SMission[NowAction] = 4;

  862.         Escaping = 1;

  863.         std::cout << "RUN!";

  864.     }

  865. }

  866. 

  867. 

  868. //监管者函数区

  869. void TMapClear(ITrickerAPI& api)

  870. {

  871.     for (int i = 0; i < 50; i++)//设置临时地图

  872.     {

  873.         for (int j = 0; j < 50; j++)

  874.         {

  875.             if (api.GetPlaceType(i, j) == THUAI6::PlaceType::Wall || api.GetPlaceType(i, j) == THUAI6::PlaceType::Chest || api.GetPlaceType(i, j) == THUAI6::PlaceType::ClassRoom) //（i，j不属于草地也不属于陆地）

  876.             {

  877.                 TempMap[i][j] = 1;

  878.             }

  879.             if (api.GetPlaceType(i, j) == THUAI6::PlaceType::Window) //（i，j）属于窗户

  880.             {

  881.                 TempMap[i][j] = 3;

  882.             }

  883.         }

  884.     }

  885.     for (int i = 0; i < 50; i++)

  886.     {

  887.         for (int j = 0; j < 50; j++)

  888.         {

  889.             TempMapCount[i][j] = 9999.0;

  890.         }

  891.     }

  892.     if (SMission[NowAction]==-1)

  893.     {

  894.         {

  895.             for (int i = 0; i < 10; i++)

  896.             {

  897.                 if (ScanClass[i] == 0)

  898.                 {

  899.                     TempMap[ScanClassX[i]][ScanClassY[i]] = 0;

  900.                 }

  901.             }

  902.             //if ((abs(api.GetSelfInfo()->x - api.CellToGrid(ScanClassX[TargetClass[NowAction]])) + abs(api.GetSelfInfo()->y - api.CellToGrid(ScanClassX[TargetClass[NowAction]])))<= 2000)

  903.             if (((abs(STPXC[NowAction] - ScanClassX[TargetClass[NowAction]])) + abs(STPYC[NowAction] - ScanClassY[TargetClass[NowAction]])) <= 1)

  904.             {

  905.                 SMission[NowAction] = 1;

  906.             }

  907.         }

  908.     }

  909.     return;

  910. }

  911. void BallLocate(ITrickerAPI& api)

  912. {

  913.     STPXC[NowAction] = api.GridToCell(api.GetSelfInfo()->x);

  914.     STPYC[NowAction] = api.GridToCell(api.GetSelfInfo()->y);

  915.     STPX[0][NowAction] = api.GridToCell(api.GetSelfInfo()->x - HalfBall);//0号左上

  916.     STPY[0][NowAction] = api.GridToCell(api.GetSelfInfo()->y - HalfBall);

  917.     STPX[1][NowAction] = api.GridToCell(api.GetSelfInfo()->x + HalfBall);//1号右下

  918.     STPY[1][NowAction] = api.GridToCell(api.GetSelfInfo()->y + HalfBall);

  919.     STPX[2][NowAction] = api.GridToCell(api.GetSelfInfo()->x - HalfBall);//2号右上

  920.     STPY[2][NowAction] = api.GridToCell(api.GetSelfInfo()->y + HalfBall);

  921.     STPX[3][NowAction] = api.GridToCell(api.GetSelfInfo()->x + HalfBall);//3号左下

  922.     STPY[3][NowAction] = api.GridToCell(api.GetSelfInfo()->y - HalfBall);

  923. }

  924. void LandMove(ITrickerAPI& api)

  925. {

  926.     if ((STempPlaceX[NowAction] != SAttemptX[NowAction]) || (STempPlaceY[NowAction] != SAttemptY[NowAction]))

  927.     {

  928.         if (CurrentChoice[NowAction] == 0) { api.Move(MoveDuring, 3.14); }

  929.         if (CurrentChoice[NowAction] == 1) { api.Move(MoveDuring, 1.57); }

  930.         if (CurrentChoice[NowAction] == 2) { api.Move(MoveDuring, 0); }

  931.         if (CurrentChoice[NowAction] == 3) { api.Move(MoveDuring, 4.71); }

  932.     }

  933. }

  934. void RoadDirectionMove(ITrickerAPI& api)//寻路系统

  935. {

  936.     BallLocate(api);

  937.     if ((STPX[1][NowAction] == STPX[0][NowAction]) && (STPY[1][NowAction] == STPY[0][NowAction]))//确定整个在同一个格子内

  938.     {

  939.         STempPlaceX[NowAction] = STPXC[NowAction]; STempPlaceY[NowAction] = STPYC[NowAction];

  940.     }

  941.     if (TempMap[STPX[0][NowAction]][STPY[0][NowAction]] == 1)//若偏离，补救措施

  942.     {

  943.         api.Move(AdjustmentDuring, 0.785);

  944.     }

  945.     else if (TempMap[STPX[1][NowAction]][STPY[1][NowAction]] == 1)

  946.     {

  947.         api.Move(AdjustmentDuring, 3.925);

  948.     }

  949.     else if (TempMap[STPX[2][NowAction]][STPY[2][NowAction]] == 1)

  950.     {

  951.         api.Move(AdjustmentDuring, 5.495);

  952.     }

  953.     else if (TempMap[STPX[1][NowAction]][STPY[1][NowAction]] == 1)

  954.     {

  955.         api.Move(AdjustmentDuring, 2.395);

  956.     }

  957.     else

  958.     {

  959.         firststep((STempPlaceX[NowAction]), (STempPlaceY[NowAction]));

  960.         NextStep();

  961.         if (NextPlaceType[NowAction] == 0) { LandMove(api); }

  962.         else if (NextPlaceType[NowAction] == 3)

  963.         {

  964.             api.SkipWindow();

  965.         }

  966.     }

  967. }

  968. 

  969. int firststepForTRoom(int f, int g)//寻路的第一步，单独分出来的原因是我们的目的就是下一步的位置

  970. {

  971.     if (f < 0 || f>49 || g < 0 || g>49) {

  972.         return 0;

  973.     }

  974.     else

  975.     {

  976.         for (int i = 0; i < 50; i++)

  977.         {

  978.             for (int j = 0; j < 50; j++)

  979.             {

  980.                 TempMapCount[i][j] = 9999.0;

  981.             }

  982.         }

  983.         NextPlaceType[NowAction] = 3;

  984.         CurrentChoice[NowAction] = 5;//Test

  985.         TempMap[f][g] = 1;

  986.         CurrentSteps = 0.0;//初始化现在步数

  987.         LessSteps = 9999.0;//初始化当前寻路过程的最少步数    

  988.         NowTrialDirect = 0;//尝试向上的所有分支

  989.         trialstepForTRoom((f - 1), g);

  990.         CurrentSteps = 0.0;

  991.         NowTrialDirect = 1;//尝试向右的所有分支

  992.         trialstepForTRoom((f), (g + 1));

  993.         CurrentSteps = 0.0;

  994.         NowTrialDirect = 2;//尝试向下的所有分支

  995.         trialstepForTRoom((f + 1), g);

  996.         TempMap[f][g] = 0;

  997.         NowTrialDirect = 3;//尝试向左的所有分支

  998.         trialstepForTRoom(f, (g - 1));

  999.         CurrentSteps = 0.0;

  1000.         NextStep();

  1001.         if (LessSteps < 9999.0) { return CurrentChoice[NowAction]; }

  1002.         else return 0;

  1003.     }

  1004. }

  1005. void trialstepForTRoom(int f, int g)//用于一步步测试，该函数使用了递归

  1006. {

  1007.     int FinalFlag = 0;

  1008.     if (f < 0 || f>49 || g < 0 || g>49) { return; }//如果越界，直接结束该分支

  1009.     else

  1010.     {

  1011.         if (TempMap[f][g] == 1 || TempMap[f][g] == 4) {}//如果临时地图TempMap上（f，g）不可移动：直接结束该分支

  1012.         else//说明这边至少是可以走的，进行下一步尝试

  1013.         {

  1014.             if ((CurrentSteps + LandCount) < TempMapCount[f][g])

  1015.             {

  1016.                 CurrentSteps += LandCount;

  1017.                 TempMapCount[f][g] = CurrentSteps;

  1018.                 for (int i = 0; i < 10; i++)

  1019.                 {

  1020.                     if (f == SAttemptX[NowAction] && g == SAttemptY[NowAction])//原checkstep函数改换至此

  1021.                     {

  1022.                         FinalFlag = 1;

  1023.                         if (CurrentSteps < LessSteps)

  1024.                         {

  1025.                             LessSteps = CurrentSteps;

  1026.                             CurrentChoice[NowAction] = NowTrialDirect;

  1027.                             TargetClass[NowAction] = i;//这暂时是必要的，因为后期要写这个教室被完成了

  1028.                             SAttemptX[NowAction] = f;

  1029.                             SAttemptX[NowAction] = g;

  1030.                         }

  1031.                     }

  1032.                 }

  1033.                 if (FinalFlag == 0)

  1034.                 {

  1035.                     TempMap[f][g] ++;

  1036.                     trialstepForTRoom((f - 1), g);

  1037.                     trialstepForTRoom((f), (g + 1));

  1038.                     trialstepForTRoom((f + 1), g);

  1039.                     trialstepForTRoom(f, (g - 1));

  1040.                     TempMap[f][g] --;

  1041.                 }

  1042.                 FinalFlag = 0;

  1043.                 CurrentSteps -= LandCount;

  1044.             }

  1045.         }

  1046.     }

  1047.     return;

  1048. }

  1049. void RoadDirectionMoveForTRoom(ITrickerAPI& api)//寻路系统

  1050. {

  1051.     BallLocate(api);

  1052.     //if ((STPX[1][NowAction] == STPX[0][NowAction]) && (STPY[1][NowAction] == STPY[0][NowAction]))//确定整个在同一个格子内

  1053.     {

  1054.         STempPlaceX[NowAction] = STPXC[NowAction]; STempPlaceY[NowAction] = STPYC[NowAction];

  1055.     }

  1056.     if (TempMap[STPX[0][NowAction]][STPY[0][NowAction]] == 1 || TempMap[STPX[0][NowAction]][STPY[0][NowAction]] == 4)//若偏离，补救措施

  1057.     {

  1058.         api.Move(AdjustmentDuring, 0.786);

  1059.     }

  1060.     else if (TempMap[STPX[1][NowAction]][STPY[1][NowAction]] == 1 || TempMap[STPX[1][NowAction]][STPY[1][NowAction]] == 4)

  1061.     {

  1062.         api.Move(AdjustmentDuring, 3.925);

  1063.     }

  1064.     else if (TempMap[STPX[2][NowAction]][STPY[2][NowAction]] == 1 || TempMap[STPX[2][NowAction]][STPY[2][NowAction]] == 4)

  1065.     {

  1066.         api.Move(AdjustmentDuring, 5.495);

  1067.     }

  1068.     else if (TempMap[STPX[3][NowAction]][STPY[3][NowAction]] == 1 || TempMap[STPX[3][NowAction]][STPY[3][NowAction]] == 4)

  1069.     {

  1070.         api.Move(AdjustmentDuring, 2.395);

  1071.     }

  1072.     else

  1073.     {

  1074.         firststepForTRoom((STempPlaceX[NowAction]), (STempPlaceY[NowAction]));

  1075.         NextStep();

  1076.         if (NextPlaceType[NowAction] == 0) { LandMove(api); }

  1077.         else if (NextPlaceType[NowAction] == 3)

  1078.         {

  1079.             api.SkipWindow();

  1080.         }

  1081.     }

  1082. 

  1083.     //else {LandMove(api); }//For Debug

  1084. }//寻路

  1085. 

  1086. void SpecialMapCheck(ITrickerAPI& api)

  1087. {

  1088.     int TotalNumber1 = 0;

  1089.     int TotalNumber2 = 0;

  1090.     if (GameStartFlag == true) {}

  1091.     else

  1092.     {

  1093.         for (int i = 0; i < 50; i++)

  1094.         {

  1095.             for (int j = 0; j < 50; j++)

  1096.             {

  1097.                 if (api.GetPlaceType(i, j) == THUAI6::PlaceType::ClassRoom)

  1098.                 {

  1099.                     ScanClassX[TotalNumber1] = i;

  1100.                     ScanClassY[TotalNumber1] = j;

  1101.                     TotalNumber1++;

  1102.                 }

  1103.                 if (api.GetPlaceType(i, j) == THUAI6::PlaceType::Gate)

  1104.                 {

  1105.                     ScanGateX[TotalNumber2] = i;

  1106.                     ScanGateY[TotalNumber2] = j;

  1107.                     TotalNumber2++;

  1108.                 }

  1109.                 if (api.GetPlaceType(i, j) == THUAI6::PlaceType::Grass)

  1110.                 {

  1111.                     GrassMap[i][j] = 1;

  1112.                 }

  1113.             }

  1114.         }

  1115.     }

  1116.     return;

  1117. }

  1118. void GameStartSettings(ITrickerAPI& api)

  1119. {

  1120.     SpecialMapCheck(api);

  1121.     SMission[4] = -1;

  1122.     GameStartFlag = true;

  1123. }

  1124. 

  1125. void StuLocate(ITrickerAPI& api)

  1126. {

  1127.     int num = api.GetStudents().size();

  1128.     bool stu = api.GetStudents().empty();

  1129.     if (stu!=true)

  1130.     {

  1131.         for (int i = 0; i < num; i++)

  1132.         {

  1133.             if (api.GetStudents()[i]->studentType != THUAI6::StudentType::Teacher && api.GetStudents()[i]->studentType != THUAI6::StudentType::NullStudentType)

  1134.             {

  1135.                 SMission[NowAction] = -1;

  1136.                 int Xtarget = api.GetStudents()[i]->x;

  1137.                 int Ytarget = api.GetStudents()[i]->y;

  1138.                 double ShotAngle = (api.GetSelfInfo()->y - Ytarget) / (api.GetSelfInfo()->x - Xtarget);

  1139.                 double distanceq = abs(api.GetSelfInfo()->y - Ytarget) * abs(api.GetSelfInfo()->y - Ytarget) + abs(api.GetSelfInfo()->x - Xtarget) * abs(api.GetSelfInfo()->x - Xtarget);

  1140.                 if (distanceq < 9000000.0)

  1141.                 {

  1142.                     if (api.GetSelfInfo()->x > Xtarget) { api.Attack(atan(ShotAngle) + 3.14); }

  1143.                     else api.Attack(atan(ShotAngle));

  1144.                 }

  1145.                 //SAttemptX[NowAction] = api.GridToCell(Xtarget);

  1146.                 //SAttemptY[NowAction] = api.GridToCell(Ytarget);

  1147.                 std::cout << "Get Student!";

  1148.             }

  1149.         }

  1150.     }

  1151.     else

  1152.     {

  1153.     }

  1154. }

  1155. 

  1156. void TMissionCheck()

  1157. {

  1158. 

  1159. }

  1160. 

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

  1162. {

  1163.     GameStartSettings(api);

  1164.     TotalDoneClass = ClassroomCheck(api);

  1165.     // 公共操作

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

  1167.     {

  1168.         // 玩家0执行操作

  1169.         NowAction = 0;

  1170.         SGetMessage(api);

  1171.         MapClear(api);

  1172.         BallLocate(api);

  1173.         MissionCheck(api);    

  1174.         SAction(api);

  1175.         MapReset();

  1176.         BallLocate(api);

  1177.     }

  1178.     else if (this->playerID == 1)

  1179.     {

  1180.         // 玩家1执行操作

  1181.         NowAction = 1;

  1182.         SGetMessage(api);

  1183.         MapClear(api);

  1184.         BallLocate(api);

  1185.         MissionCheck(api);

  1186.         SAction(api);

  1187.         MapReset();

  1188.         BallLocate(api);

  1189.     }

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

  1191.     {

  1192.         // 玩家2执行操作

  1193.         NowAction = 2;

  1194.         SGetMessage(api);

  1195.         MapClear(api);

  1196.         BallLocate(api);

  1197.         MissionCheck(api);

  1198.         SAction(api);

  1199.         MapReset();

  1200.         BallLocate(api);

  1201.     }

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

  1203.     {

  1204.         // 玩家3执行操作

  1205.         NowAction = 3;

  1206.         SGetMessage(api);

  1207.         MapClear(api);

  1208.         BallLocate(api);

  1209.         MissionCheck(api);

  1210.         SAction(api);

  1211.         MapReset();

  1212.         BallLocate(api);

  1213.     }

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

  1215.     // 公共操作

  1216.     std::cout << "NUM" << TotalDoneClass;

  1217.     std::cout << "State" << SMission[NowAction];

  1218.     if (Escaping == 1) { printf("Now Escaping!\n"); }

  1219.     std:: cout<< GrassMap[STPXC[NowAction]][STPYC[NowAction]];

  1220.     api.UseSkill(0);

  1221. }

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

  1223. {

  1224.     TMapClear(api);

  1225.     GameStartSettings(api);

  1226.     NowAction = 4;

  1227.     StuLocate(api);

  1228.     if (SMission[NowAction] == -1)

  1229.     {

  1230.         RoadDirectionMoveForTRoom(api);

  1231.     }

  1232.     if (LessSteps == 9999.0)

  1233.     {

  1234.         std::cout << "Change";

  1235.         SMission[NowAction] = 1;

  1236.     }

  1237.     if (SAttemptX[NowAction]==STPXC[NowAction]&&SAttemptY[NowAction]==STPYC[NowAction])

  1238.     {

  1239.         std::cout << "Change";

  1240.         SMission[NowAction] = 1;

  1241.     }

  1242.     if (SMission[NowAction] == 1)

  1243.     {

  1244.         srand(time(0));

  1245.         int a = rand() % 10;

  1246.         SAttemptX[NowAction] = ScanClassX[a];

  1247.         SAttemptY[NowAction] = ScanClassY[a];

  1248.         RoadDirectionMoveForTRoom(api);

  1249.         SMission[4] = -1;

  1250.     }

  1251.     api.UseSkill(1);

  1252.     api.UseSkill(2);

  1253.     MapReset();

  1254.     std::cout << SAttemptX[NowAction] << SAttemptY[NowAction]<<SMission[NowAction];

  1255. }