simulator.h 20 KB

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