simulator.h 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659
  1. #ifndef SIMULATOR_H
  2. #define SIMULATOR_H
  3. #include <array>
  4. #include <vector>
  5. #include <memory>
  6. #include <climits>
  7. #include <stdint.h>
  8. using namespace std;
  9. enum {
  10. CYCLE_TIMEOUT = 100000,
  11. FIELDS_XY = 20,
  12. };
  13. struct Position {
  14. size_t x = 0;
  15. size_t y = 0;
  16. Position()
  17. : x(0)
  18. , y(0)
  19. {}
  20. Position(size_t _x, size_t _y)
  21. : x(_x)
  22. , y(_y)
  23. {}
  24. Position(const Position& _pos)
  25. : x(_pos.x)
  26. , y(_pos.y)
  27. {}
  28. };
  29. enum Direction {
  30. Right,
  31. Down,
  32. Left,
  33. Up,
  34. };
  35. enum Command : uint16_t {
  36. NOP,
  37. CREATE,
  38. MOVE,
  39. DIE,
  40. TRANS,
  41. RTRANS,
  42. TURN,
  43. JUMP,
  44. AJUMP,
  45. BJUMP,
  46. SCAN,
  47. FARSCAN,
  48. SET,
  49. ADD,
  50. SUB,
  51. MUL,
  52. DIV,
  53. MOD,
  54. MIN,
  55. MAX,
  56. RANDOM,
  57. IF,
  58. IFN,
  59. IFG,
  60. IFL,
  61. IFGE,
  62. IFLE,
  63. // INIT,
  64. // BREAK,
  65. // RESUME,
  66. // SEIZE,
  67. // SLEEP,
  68. // QUIT,
  69. };
  70. enum Params : uint16_t {
  71. LLL,
  72. LLV,
  73. LVL,
  74. LVV,
  75. VLL,
  76. VLV,
  77. VVL,
  78. VVV,
  79. N = LLL,
  80. L = LLL,
  81. V = VLL,
  82. LL = LLL,
  83. LV = LVL,
  84. VL = VLL,
  85. VV = VVV,
  86. };
  87. enum Variables {
  88. Local_0,
  89. Local_1,
  90. Local_2,
  91. Local_3,
  92. Local_4,
  93. Local_5,
  94. Local_6,
  95. Local_7,
  96. Local_8,
  97. Local_9,
  98. Local_10,
  99. Local_11,
  100. Local_12,
  101. Local_13,
  102. Local_14,
  103. Local_15,
  104. Local_16,
  105. Local_17,
  106. Local_18,
  107. Local_19,
  108. LocalActive,
  109. LocalBanks,
  110. LocalInstrSet,
  111. LocalMobile,
  112. LocalAge,
  113. LocalTasks,
  114. LocalGeneration,
  115. LocalId,
  116. RemoteActive,
  117. RemoteBanks,
  118. RemoteInstrSet,
  119. RemoteMobile,
  120. RemoteAge,
  121. RemoteTasks,
  122. RemoteGeneration,
  123. GlobalPub,
  124. GlobalTeam,
  125. GlobalOwn,
  126. GlobalOthers,
  127. GlobalFields,
  128. GlobalTime,
  129. GlobalTimeout,
  130. };
  131. enum Error {
  132. NoError, // No error
  133. EliminationTrigger, // Elimination Trigger released
  134. DataHunger, // Data Hunger (Bank 1 empty and executed)
  135. DivisionByZero, // Division by zero
  136. InvalidBankNumber, // Invalid bank number (e.g. in TRANS or BJUMP)
  137. HigherInstructionSetRequired, // Higher Instruction Set required
  138. MobilityRequired, // Mobility required
  139. DieExecuted, // DIE executed
  140. InvalidParameter , // Invalid parameter (e.g. CREATE x, -1, x)
  141. Unemployment, // No more tasks left in a robot (Unemployment)
  142. InstructionDurationTooHigh, // Instruction duration too high (i.e. > MaxInstrDur)
  143. };
  144. using Parameter = int32_t;
  145. struct Instruction {
  146. Command command = NOP;
  147. Params params = N;
  148. Parameter a = 0;
  149. Parameter b = 0;
  150. Parameter c = 0;
  151. Instruction(Command _command, Params _params = N, Parameter _a = 0, Parameter _b = 0, Parameter _c = 0)
  152. : command(_command)
  153. , params(_params)
  154. , a(_a)
  155. , b(_b)
  156. , c(_c)
  157. {
  158. }
  159. };
  160. struct Team {
  161. QColor color = Qt::red;
  162. Team(QColor color)
  163. : color(color)
  164. {
  165. }
  166. };
  167. struct Bank {
  168. shared_ptr<Team> team;
  169. vector<Instruction> instructions;
  170. Bank(shared_ptr<Team> team, const vector<Instruction>& instructions)
  171. : team(team)
  172. , instructions(instructions)
  173. {
  174. }
  175. Bank(const Bank& bank)
  176. : team(bank.team)
  177. , instructions(bank.instructions)
  178. {
  179. }
  180. };
  181. using BankIndex = size_t;
  182. using InstIndex = size_t;
  183. using TaskIndex = size_t;
  184. struct Task {
  185. Direction direction = Right;
  186. BankIndex bankIndex = 0;
  187. InstIndex instIndex = 0;
  188. int32_t a = 0;
  189. int32_t b = 0;
  190. int32_t c = 0;
  191. int32_t* p_a = nullptr;
  192. int32_t* p_b = nullptr;
  193. int32_t* p_c = nullptr;
  194. };
  195. struct Program {
  196. int active = 0;
  197. int instructionSet = 0;
  198. int mobile = 0;
  199. int creationCycle = 0;
  200. int generation = 0;
  201. Error error = NoError;
  202. shared_ptr<Team> team;
  203. Position position;
  204. vector<Task> tasks;
  205. TaskIndex taskIndex = 0;
  206. vector<shared_ptr<Bank>> banks;
  207. array<int32_t, 20> vars{{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}};
  208. Program(shared_ptr<Team> _team, Position _position, int32_t instructionSet, int32_t slotCount, int32_t mobile) {
  209. team = _team;
  210. position = _position;
  211. banks.resize(slotCount);
  212. tasks.resize(1);
  213. }
  214. };
  215. struct Field {
  216. Program* program = nullptr;
  217. };
  218. struct Simulator {
  219. size_t cycle = 0;
  220. vector<Program> programs;
  221. Simulator() {
  222. programs.reserve(FIELDS_XY * FIELDS_XY);
  223. // std::srand(std::time(0));
  224. std::srand(0);
  225. }
  226. Position calcPosition(Position position, Direction direction, int32_t distance) {
  227. switch(direction) {
  228. case Right: return Position{(position.x + distance) % FIELDS_XY, position.y};
  229. case Down: return Position{position.x, (position.y + distance) % FIELDS_XY};
  230. case Left: return Position{(position.x - distance) % FIELDS_XY, position.y};
  231. case Up: return Position{position.x, (position.y - distance) % FIELDS_XY};
  232. }
  233. }
  234. void loadProgram(QColor color, size_t x, size_t y) {
  235. shared_ptr<Team> team = make_shared<Team>(color);
  236. programs.push_back(Program(team, Position{x, y}, 2, 50, 1));
  237. programs.back().banks[0] = make_shared<Bank>(team, vector<Instruction>{
  238. Instruction(BJUMP, LL, 1, 0)
  239. });
  240. programs.back().banks[1] = make_shared<Bank>(team, vector<Instruction>{
  241. Instruction(SCAN, V, 1),
  242. Instruction(CREATE, LLL, 2, 50, 1),
  243. Instruction(TRANS, LL, 0, 0),
  244. Instruction(TRANS, LL, 1, 1),
  245. Instruction(TURN, L, 0),
  246. Instruction(AJUMP, L, 0)
  247. });
  248. }
  249. Program* findProgram(Position position) {
  250. for(auto& program : programs) {
  251. if(program.position.x == position.x && program.position.y == position.y && program.error == NoError) {
  252. return &program;
  253. }
  254. }
  255. return nullptr;
  256. }
  257. void simulate() {
  258. for (auto& program : programs) {
  259. auto& taskIndex = program.taskIndex;
  260. if(program.error != NoError) {
  261. continue;
  262. }
  263. if(program.tasks.empty()) {
  264. continue;
  265. }
  266. taskIndex = (taskIndex + 1) % program.tasks.size();
  267. if (taskIndex < program.tasks.size()) {
  268. auto& task = program.tasks[taskIndex];
  269. if(task.bankIndex >= program.banks.size()) {
  270. continue;
  271. }
  272. const auto bank_ptr = program.banks[task.bankIndex].get();
  273. if(bank_ptr == nullptr || task.instIndex >= bank_ptr->instructions.size()) {
  274. continue;
  275. }
  276. const auto& bank = *bank_ptr;
  277. const auto& inst = bank.instructions[task.instIndex];
  278. //prevent overrideing of instuctions...
  279. auto mapParameters = [this](Program& program, Task& task, const Instruction& inst) {
  280. task.p_a = &task.a;
  281. task.p_b = &task.b;
  282. task.p_c = &task.c;
  283. auto decode = [&](int32_t*& v) {
  284. switch(*v) {
  285. case Local_0: v = &program.vars[0]; break;
  286. case Local_1: v = &program.vars[1]; break;
  287. case Local_2: v = &program.vars[2]; break;
  288. case Local_3: v = &program.vars[3]; break;
  289. case Local_4: v = &program.vars[4]; break;
  290. case Local_5: v = &program.vars[5]; break;
  291. case Local_6: v = &program.vars[6]; break;
  292. case Local_7: v = &program.vars[7]; break;
  293. case Local_8: v = &program.vars[8]; break;
  294. case Local_9: v = &program.vars[9]; break;
  295. case Local_10: v = &program.vars[10]; break;
  296. case Local_11: v = &program.vars[11]; break;
  297. case Local_12: v = &program.vars[12]; break;
  298. case Local_13: v = &program.vars[13]; break;
  299. case Local_14: v = &program.vars[14]; break;
  300. case Local_15: v = &program.vars[15]; break;
  301. case Local_16: v = &program.vars[16]; break;
  302. case Local_17: v = &program.vars[17]; break;
  303. case Local_18: v = &program.vars[18]; break;
  304. case Local_19: v = &program.vars[19]; break;
  305. case LocalActive:
  306. v = &program.active;
  307. break;
  308. case LocalBanks:
  309. *v = program.banks.size();
  310. break;
  311. case LocalInstrSet:
  312. *v = program.instructionSet;
  313. break;
  314. case LocalMobile:
  315. *v = program.mobile;
  316. break;
  317. case LocalAge:
  318. *v = cycle - program.creationCycle;
  319. break;
  320. case LocalTasks:
  321. *v = program.tasks.size();
  322. break;
  323. case LocalGeneration:
  324. *v = program.generation;
  325. break;
  326. case LocalId:
  327. // @todo
  328. break;
  329. case RemoteActive: {
  330. auto remotePosition = calcPosition(program.position, task.direction, 1);
  331. auto remoteProgram = findProgram(remotePosition);
  332. if(remoteProgram) {
  333. v = &remoteProgram->active;
  334. }
  335. else {
  336. *v = 0;
  337. }
  338. break;
  339. }
  340. case RemoteBanks: {
  341. auto remotePosition = calcPosition(program.position, task.direction, 1);
  342. auto remoteProgram = findProgram(remotePosition);
  343. *v = remoteProgram ? remoteProgram->banks.size() : 0;
  344. break;
  345. }
  346. case RemoteInstrSet: {
  347. auto remotePosition = calcPosition(program.position, task.direction, 1);
  348. auto remoteProgram = findProgram(remotePosition);
  349. *v = remoteProgram ? remoteProgram->instructionSet : 0;
  350. break;
  351. }
  352. case RemoteMobile: {
  353. auto remotePosition = calcPosition(program.position, task.direction, 1);
  354. auto remoteProgram = findProgram(remotePosition);
  355. *v = remoteProgram ? remoteProgram->mobile: 0;
  356. break;
  357. }
  358. case RemoteAge: {
  359. auto remotePosition = calcPosition(program.position, task.direction, 1);
  360. auto remoteProgram = findProgram(remotePosition);
  361. *v = remoteProgram ? (cycle - remoteProgram->creationCycle) : 0;
  362. break;
  363. }
  364. case RemoteTasks: {
  365. auto remotePosition = calcPosition(program.position, task.direction, 1);
  366. auto remoteProgram = findProgram(remotePosition);
  367. *v = remoteProgram ? remoteProgram->tasks.size() : 0;
  368. break;
  369. }
  370. case RemoteGeneration: {
  371. auto remotePosition = calcPosition(program.position, task.direction, 1);
  372. auto remoteProgram = findProgram(remotePosition);
  373. *v = remoteProgram ? remoteProgram->generation : 0;
  374. break;
  375. }
  376. case GlobalPub:
  377. // @todo
  378. break;
  379. case GlobalTeam:
  380. // @todo
  381. break;
  382. case GlobalOwn:
  383. // @todo
  384. break;
  385. case GlobalOthers:
  386. // @todo
  387. break;
  388. case GlobalFields:
  389. *v = FIELDS_XY * FIELDS_XY;
  390. break;
  391. case GlobalTime:
  392. *v = cycle;
  393. break;
  394. case GlobalTimeout:
  395. *v = CYCLE_TIMEOUT;
  396. break;
  397. }
  398. };
  399. switch(inst.params) {
  400. case LLL: { task.a = inst.a; task.b = inst.b; task.c = inst.c; break; }
  401. case LLV: { task.a = inst.a; task.b = inst.b; decode(task.p_c); break; }
  402. case LVL: { task.a = inst.a; decode(task.p_b); task.c = inst.c; break; }
  403. case LVV: { task.a = inst.a; decode(task.p_b); decode(task.p_c); break; }
  404. case VLL: { decode(task.p_a); task.b = inst.b; task.c = inst.c; break; }
  405. case VLV: { decode(task.p_a); task.b = inst.b; decode(task.p_c); break; }
  406. case VVL: { decode(task.p_a); decode(task.p_b); task.c = inst.c; break; }
  407. case VVV: { decode(task.p_a); decode(task.p_b); decode(task.p_c); break; }
  408. }
  409. };
  410. mapParameters(program, task, inst);
  411. switch(inst.command) {
  412. case CREATE: {
  413. auto remotePosition = calcPosition(program.position, task.direction, 1);
  414. auto remoteProgram = findProgram(remotePosition);
  415. if(!remoteProgram) {
  416. programs.push_back(Program(program.team, remotePosition, *task.p_a, *task.p_b, *task.p_c));
  417. }
  418. task.instIndex += 1;
  419. break;
  420. }
  421. case MOVE: {
  422. auto remotePosition = calcPosition(program.position, task.direction, 1);
  423. auto remoteProgram = findProgram(remotePosition);
  424. if(!remoteProgram) {
  425. program.position = remotePosition;
  426. }
  427. task.instIndex += 1;
  428. break;
  429. }
  430. case DIE: {
  431. program.error = DieExecuted;
  432. task.instIndex += 1;
  433. break;
  434. }
  435. case TRANS: {
  436. auto remotePosition = calcPosition(program.position, task.direction, 1);
  437. auto remoteProgram = findProgram(remotePosition);
  438. if(remoteProgram && *task.p_b < remoteProgram->banks.size() && *task.p_a < program.banks.size()) {
  439. remoteProgram->banks[*task.p_b] = program.banks[*task.p_a];
  440. }
  441. task.instIndex += 1;
  442. break;
  443. }
  444. case RTRANS: {
  445. auto remotePosition = calcPosition(program.position, task.direction, 1);
  446. auto remoteProgram = findProgram(remotePosition);
  447. if(remoteProgram && *task.p_a < remoteProgram->banks.size() && *task.p_b < program.banks.size()) {
  448. program.banks[*task.p_b] = remoteProgram->banks[*task.p_a];
  449. }
  450. task.instIndex += 1;
  451. break;
  452. }
  453. case TURN: {
  454. task.direction = static_cast<Direction>(qMax(0, (task.direction + ((*task.p_a >= 0) ? 1 : -1)) % 4));
  455. task.instIndex += 1;
  456. break;
  457. }
  458. case JUMP: {
  459. task.instIndex += *task.p_a;
  460. break;
  461. }
  462. case AJUMP: {
  463. task.instIndex = *task.p_a;
  464. break;
  465. }
  466. case BJUMP: {
  467. task.bankIndex = *task.p_a;
  468. task.instIndex = *task.p_b;
  469. break;
  470. }
  471. case SCAN: {
  472. // Scans a field, result in #a
  473. // #a=0 ...empty.
  474. // #a=1 ...enemy
  475. // #a=2 ...friend
  476. auto remotePosition = calcPosition(program.position, task.direction, 1);
  477. auto remoteProgram = findProgram(remotePosition);
  478. *task.p_a = !remoteProgram ? 0 : remoteProgram->team == program.team ? 2: 1;
  479. task.instIndex += 1;
  480. break;
  481. }
  482. case FARSCAN: {
  483. // Scans up to c fields straight in front of the bot.
  484. // The nearest bot's type is stored in #a:
  485. // #a=0 ...empty.
  486. // #a=1 ...enemy
  487. // #a=2 ...friend
  488. // Its distance is stored in #b.
  489. *task.p_a = 0;
  490. *task.p_b = 0;
  491. for(int i = 0; i < *task.p_c; ++i) {
  492. auto remotePosition = calcPosition(program.position, task.direction, i + 1);
  493. auto remoteProgram = findProgram(remotePosition);
  494. if(remoteProgram) {
  495. *task.p_a = remoteProgram->team == program.team ? 2: 1;
  496. *task.p_b = i;
  497. break;
  498. }
  499. }
  500. task.instIndex += 1;
  501. break;
  502. }
  503. case SET:
  504. *task.p_a = *task.p_b;
  505. task.instIndex += 1;
  506. break;
  507. case ADD:
  508. *task.p_a += *task.p_b;
  509. task.instIndex += 1;
  510. break;
  511. case SUB:
  512. *task.p_a -= *task.p_b;
  513. task.instIndex += 1;
  514. break;
  515. case MUL:
  516. *task.p_a *= *task.p_b;
  517. task.instIndex += 1;
  518. break;
  519. case DIV:
  520. *task.p_a /= *task.p_b;
  521. task.instIndex += 1;
  522. break;
  523. case MOD:
  524. *task.p_a %= *task.p_b;
  525. task.instIndex += 1;
  526. break;
  527. case MIN:
  528. *task.p_a = qMin(*task.p_a, *task.p_b);
  529. task.instIndex += 1;
  530. break;
  531. case MAX:
  532. *task.p_a = qMax(*task.p_a, *task.p_b);
  533. task.instIndex += 1;
  534. break;
  535. case RANDOM:
  536. *task.p_a = *task.p_b + (rand() % (*task.p_c - *task.p_b + 1));
  537. task.instIndex += 1;
  538. break;
  539. case IF:
  540. task.instIndex += ((*task.p_a == *task.p_b) ? 1 : 2);
  541. break;
  542. case IFN:
  543. task.instIndex += ((*task.p_a != *task.p_b) ? 1 : 2);
  544. break;
  545. case IFG:
  546. task.instIndex += ((*task.p_a > *task.p_b) ? 1 : 2);
  547. break;
  548. case IFL:
  549. task.instIndex += ((*task.p_a < *task.p_b) ? 1 : 2);
  550. break;
  551. case IFGE:
  552. task.instIndex += ((*task.p_a >= *task.p_b) ? 1 : 2);
  553. break;
  554. case IFLE:
  555. task.instIndex += ((*task.p_a <= *task.p_b) ? 1 : 2);
  556. break;
  557. default:
  558. task.instIndex += 1;
  559. break;
  560. }
  561. }
  562. }
  563. ++cycle;
  564. }
  565. };
  566. #endif // SIMULATOR_H