1
1

simulator.h 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632
  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. using Bank = shared_ptr<vector<Instruction>>;
  161. using BankIndex = size_t;
  162. using InstIndex = size_t;
  163. using TaskIndex = size_t;
  164. struct Task {
  165. Direction direction = Right;
  166. BankIndex bankIndex = 0;
  167. InstIndex instIndex = 0;
  168. };
  169. struct Program {
  170. int active = 0;
  171. int instructionSet = 0;
  172. int mobile = 0;
  173. int creationCycle = 0;
  174. int generation = 0;
  175. Error error = NoError;
  176. QColor color;
  177. Position position;
  178. vector<Task> tasks;
  179. TaskIndex taskIndex = 0;
  180. vector<Bank> banks;
  181. 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}};
  182. Program(QColor _color, Position _position, int32_t instructionSet, int32_t slotCount, int32_t mobile) {
  183. color = _color;
  184. position = _position;
  185. banks.resize(slotCount);
  186. tasks.resize(1);
  187. }
  188. };
  189. struct Field {
  190. Program* program = nullptr;
  191. };
  192. struct Simulator {
  193. size_t cycle = 0;
  194. vector<Program> programs;
  195. Simulator() {
  196. programs.reserve(FIELDS_XY * FIELDS_XY);
  197. // std::srand(std::time(0));
  198. std::srand(0);
  199. }
  200. Position calcPosition(Position position, Direction direction, int32_t distance) {
  201. switch(direction) {
  202. case Right: return Position{(position.x + distance) % FIELDS_XY, position.y};
  203. case Down: return Position{position.x, (position.y + distance) % FIELDS_XY};
  204. case Left: return Position{(position.x - distance) % FIELDS_XY, position.y};
  205. case Up: return Position{position.x, (position.y - distance) % FIELDS_XY};
  206. }
  207. }
  208. void loadProgram(QColor color, size_t x, size_t y) {
  209. programs.push_back(Program(color, Position{x, y}, 2, 50, 1));
  210. {
  211. Bank bank = make_shared<vector<Instruction>>();
  212. bank->push_back(Instruction(BJUMP, LL, 1, 0));
  213. programs.back().banks[0] = bank;
  214. }
  215. {
  216. Bank bank = make_shared<vector<Instruction>>();
  217. bank->push_back(Instruction(SCAN, V, 1));
  218. bank->push_back(Instruction(CREATE, LLL, 2, 50, 1));
  219. bank->push_back(Instruction(TRANS, LL, 0, 0));
  220. bank->push_back(Instruction(TRANS, LL, 1, 1));
  221. bank->push_back(Instruction(RANDOM, VLL, 5, -5, 5));
  222. bank->push_back(Instruction(TURN, V, 5));
  223. bank->push_back(Instruction(ADD, VL, 6, 1));
  224. // bank->push_back(Instruction(IFG, VL, 6, 5));
  225. // bank->push_back(Instruction(DIE));
  226. bank->push_back(Instruction(AJUMP, L, 0));
  227. programs.back().banks[1] = bank;
  228. }
  229. }
  230. Program* findProgram(Position position) {
  231. for(auto& program : programs) {
  232. if(program.position.x == position.x && program.position.y == position.y && program.error == NoError) {
  233. return &program;
  234. }
  235. }
  236. return nullptr;
  237. }
  238. void simulate() {
  239. for (auto& program : programs) {
  240. auto& taskIndex = program.taskIndex;
  241. if(program.error != NoError) {
  242. continue;
  243. }
  244. if(program.tasks.empty()) {
  245. continue;
  246. }
  247. taskIndex = (taskIndex + 1) % program.tasks.size();
  248. if (taskIndex < program.tasks.size()) {
  249. auto& task = program.tasks[taskIndex];
  250. if(task.bankIndex >= program.banks.size()) {
  251. continue;
  252. }
  253. const auto bank_ptr = program.banks[task.bankIndex].get();
  254. if(bank_ptr == nullptr || task.instIndex >= bank_ptr->size()) {
  255. continue;
  256. }
  257. const auto& bank = *bank_ptr;
  258. const auto& inst = bank[task.instIndex];
  259. //prevent overrideing of instuctions...
  260. int32_t a_safe = inst.a;
  261. int32_t b_safe = inst.b;
  262. int32_t c_safe = inst.c;
  263. int32_t* a = &a_safe;
  264. int32_t* b = &b_safe;
  265. int32_t* c = &c_safe;
  266. auto decode = [&](int*& v) {
  267. switch(*v) {
  268. case Local_0: v = &program.vars[0]; break;
  269. case Local_1: v = &program.vars[1]; break;
  270. case Local_2: v = &program.vars[2]; break;
  271. case Local_3: v = &program.vars[3]; break;
  272. case Local_4: v = &program.vars[4]; break;
  273. case Local_5: v = &program.vars[5]; break;
  274. case Local_6: v = &program.vars[6]; break;
  275. case Local_7: v = &program.vars[7]; break;
  276. case Local_8: v = &program.vars[8]; break;
  277. case Local_9: v = &program.vars[9]; break;
  278. case Local_10: v = &program.vars[10]; break;
  279. case Local_11: v = &program.vars[11]; break;
  280. case Local_12: v = &program.vars[12]; break;
  281. case Local_13: v = &program.vars[13]; break;
  282. case Local_14: v = &program.vars[14]; break;
  283. case Local_15: v = &program.vars[15]; break;
  284. case Local_16: v = &program.vars[16]; break;
  285. case Local_17: v = &program.vars[17]; break;
  286. case Local_18: v = &program.vars[18]; break;
  287. case Local_19: v = &program.vars[19]; break;
  288. case LocalActive:
  289. v = &program.active;
  290. break;
  291. case LocalBanks:
  292. *v = program.banks.size();
  293. break;
  294. case LocalInstrSet:
  295. *v = program.instructionSet;
  296. break;
  297. case LocalMobile:
  298. *v = program.mobile;
  299. break;
  300. case LocalAge:
  301. *v = cycle - program.creationCycle;
  302. break;
  303. case LocalTasks:
  304. *v = program.tasks.size();
  305. break;
  306. case LocalGeneration:
  307. *v = program.generation;
  308. break;
  309. case LocalId:
  310. // @todo
  311. break;
  312. case RemoteActive: {
  313. auto remotePosition = calcPosition(program.position, task.direction, 1);
  314. auto remoteProgram = findProgram(remotePosition);
  315. if(remoteProgram) {
  316. v = &remoteProgram->active;
  317. }
  318. else {
  319. *v = 0;
  320. }
  321. break;
  322. }
  323. case RemoteBanks: {
  324. auto remotePosition = calcPosition(program.position, task.direction, 1);
  325. auto remoteProgram = findProgram(remotePosition);
  326. *v = remoteProgram ? remoteProgram->banks.size() : 0;
  327. break;
  328. }
  329. case RemoteInstrSet: {
  330. auto remotePosition = calcPosition(program.position, task.direction, 1);
  331. auto remoteProgram = findProgram(remotePosition);
  332. *v = remoteProgram ? remoteProgram->instructionSet : 0;
  333. break;
  334. }
  335. case RemoteMobile: {
  336. auto remotePosition = calcPosition(program.position, task.direction, 1);
  337. auto remoteProgram = findProgram(remotePosition);
  338. *v = remoteProgram ? remoteProgram->mobile: 0;
  339. break;
  340. }
  341. case RemoteAge: {
  342. auto remotePosition = calcPosition(program.position, task.direction, 1);
  343. auto remoteProgram = findProgram(remotePosition);
  344. *v = remoteProgram ? (cycle - remoteProgram->creationCycle) : 0;
  345. break;
  346. }
  347. case RemoteTasks: {
  348. auto remotePosition = calcPosition(program.position, task.direction, 1);
  349. auto remoteProgram = findProgram(remotePosition);
  350. *v = remoteProgram ? remoteProgram->tasks.size() : 0;
  351. break;
  352. }
  353. case RemoteGeneration: {
  354. auto remotePosition = calcPosition(program.position, task.direction, 1);
  355. auto remoteProgram = findProgram(remotePosition);
  356. *v = remoteProgram ? remoteProgram->generation : 0;
  357. break;
  358. }
  359. case GlobalPub:
  360. // @todo
  361. break;
  362. case GlobalTeam:
  363. // @todo
  364. break;
  365. case GlobalOwn:
  366. // @todo
  367. break;
  368. case GlobalOthers:
  369. // @todo
  370. break;
  371. case GlobalFields:
  372. *v = FIELDS_XY * FIELDS_XY;
  373. break;
  374. case GlobalTime:
  375. *v = cycle;
  376. break;
  377. case GlobalTimeout:
  378. *v = CYCLE_TIMEOUT;
  379. break;
  380. }
  381. };
  382. switch(inst.params) {
  383. case LLL: { break; }
  384. case LLV: { decode(c); break; }
  385. case LVL: { decode(b); break; }
  386. case LVV: { decode(b); decode(c); break; }
  387. case VLL: { decode(a); break; }
  388. case VLV: { decode(a); decode(c); break; }
  389. case VVL: { decode(a); decode(b); break; }
  390. case VVV: { decode(a); decode(b); decode(c); break; }
  391. }
  392. switch(inst.command) {
  393. case CREATE: {
  394. auto remotePosition = calcPosition(program.position, task.direction, 1);
  395. auto remoteProgram = findProgram(remotePosition);
  396. if(!remoteProgram) {
  397. programs.push_back(Program(program.color, remotePosition, *a, *b, *c));
  398. }
  399. task.instIndex += 1;
  400. break;
  401. }
  402. case MOVE: {
  403. auto remotePosition = calcPosition(program.position, task.direction, 1);
  404. auto remoteProgram = findProgram(remotePosition);
  405. if(!remoteProgram) {
  406. program.position = remotePosition;
  407. }
  408. task.instIndex += 1;
  409. break;
  410. }
  411. case DIE: {
  412. program.error = DieExecuted;
  413. task.instIndex += 1;
  414. break;
  415. }
  416. case TRANS: {
  417. auto remotePosition = calcPosition(program.position, task.direction, 1);
  418. auto remoteProgram = findProgram(remotePosition);
  419. if(remoteProgram && *b < remoteProgram->banks.size() && *a < program.banks.size()) {
  420. remoteProgram->banks[*b] = program.banks[*a];
  421. }
  422. task.instIndex += 1;
  423. break;
  424. }
  425. case RTRANS: {
  426. auto remotePosition = calcPosition(program.position, task.direction, 1);
  427. auto remoteProgram = findProgram(remotePosition);
  428. if(remoteProgram && *a < remoteProgram->banks.size() && *b < program.banks.size()) {
  429. program.banks[*b] = remoteProgram->banks[*a];
  430. }
  431. task.instIndex += 1;
  432. break;
  433. }
  434. case TURN: {
  435. task.direction = static_cast<Direction>(qMax(0, (task.direction + ((*a >= 0) ? 1 : -1)) % 4));
  436. task.instIndex += 1;
  437. break;
  438. }
  439. case JUMP: {
  440. task.instIndex += *a;
  441. break;
  442. }
  443. case AJUMP: {
  444. task.instIndex = *a;
  445. break;
  446. }
  447. case BJUMP: {
  448. task.bankIndex = *a;
  449. task.instIndex = *b;
  450. break;
  451. }
  452. case SCAN: {
  453. // Scans a field, result in #a
  454. // #a=0 ...empty.
  455. // #a=1 ...enemy
  456. // #a=2 ...friend
  457. auto remotePosition = calcPosition(program.position, task.direction, 1);
  458. auto remoteProgram = findProgram(remotePosition);
  459. *a = !remoteProgram ? 0 : remoteProgram->color == program.color ? 2: 1;
  460. task.instIndex += 1;
  461. break;
  462. }
  463. case FARSCAN: {
  464. // Scans up to c fields straight in front of the bot.
  465. // The nearest bot's type is stored in #a:
  466. // #a=0 ...empty.
  467. // #a=1 ...enemy
  468. // #a=2 ...friend
  469. // Its distance is stored in #b.
  470. *a = 0;
  471. *b = 0;
  472. for(int i = 0; i < *c; ++i) {
  473. auto remotePosition = calcPosition(program.position, task.direction, i + 1);
  474. auto remoteProgram = findProgram(remotePosition);
  475. if(remoteProgram) {
  476. *a = remoteProgram->color == program.color ? 2: 1;
  477. *b = i;
  478. break;
  479. }
  480. }
  481. task.instIndex += 1;
  482. break;
  483. }
  484. case SET:
  485. *a = *b;
  486. task.instIndex += 1;
  487. break;
  488. case ADD:
  489. *a += *b;
  490. task.instIndex += 1;
  491. break;
  492. case SUB:
  493. *a -= *b;
  494. task.instIndex += 1;
  495. break;
  496. case MUL:
  497. *a *= *b;
  498. task.instIndex += 1;
  499. break;
  500. case DIV:
  501. *a /= *b;
  502. task.instIndex += 1;
  503. break;
  504. case MOD:
  505. *a %= *b;
  506. task.instIndex += 1;
  507. break;
  508. case MIN:
  509. *a = qMin(*a, *b);
  510. task.instIndex += 1;
  511. break;
  512. case MAX:
  513. *a = qMax(*a, *b);
  514. task.instIndex += 1;
  515. break;
  516. case RANDOM:
  517. *a = *b + (rand() % (*c - *b + 1));
  518. task.instIndex += 1;
  519. break;
  520. case IF:
  521. task.instIndex += ((*a == *b) ? 1 : 2);
  522. break;
  523. case IFN:
  524. task.instIndex += ((*a != *b) ? 1 : 2);
  525. break;
  526. case IFG:
  527. task.instIndex += ((*a > *b) ? 1 : 2);
  528. break;
  529. case IFL:
  530. task.instIndex += ((*a < *b) ? 1 : 2);
  531. break;
  532. case IFGE:
  533. task.instIndex += ((*a >= *b) ? 1 : 2);
  534. break;
  535. case IFLE:
  536. task.instIndex += ((*a <= *b) ? 1 : 2);
  537. break;
  538. default:
  539. task.instIndex += 1;
  540. break;
  541. }
  542. }
  543. }
  544. ++cycle;
  545. }
  546. };
  547. #endif // SIMULATOR_H