Advertisement
Guest User

Untitled

a guest
Jun 21st, 2018
84
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.00 KB | None | 0 0
  1. static void run() {
  2. try {
  3. Thread.sleep(speed - 1);
  4. } catch (InterruptedException e) {
  5. // TODO Auto-generated catch block
  6. e.printStackTrace();
  7. }
  8. for (int i = 0; i < AIs; i++) {
  9. NeatEngine.setInput(0, player[i][0] - food[i][0], i);
  10. NeatEngine.setInput(1, player[i][1] - food[i][1], i);
  11. NeatEngine.setInput(2, checkPosition(player[i][0] - 1, player[i][1], i), i);
  12. NeatEngine.setInput(3, checkPosition(player[i][0] + 1, player[i][1], i), i);
  13. NeatEngine.setInput(4, checkPosition(player[i][0], player[i][1] - 1, i), i);
  14. NeatEngine.setInput(5, checkPosition(player[i][0], player[i][1] + 1, i), i);
  15. NeatEngine.setInput(6, checkPosition(player[i][0] - 1, player[i][1] - 1, i), i);
  16. NeatEngine.setInput(7, checkPosition(player[i][0] - 1, player[i][1] + 1, i), i);
  17. NeatEngine.setInput(8, checkPosition(player[i][0] + 1, player[i][1] - 1, i), i);
  18. NeatEngine.setInput(9, checkPosition(player[i][0] + 1, player[i][1] + 1, i), i);
  19.  
  20. NeatEngine.runNN(i);
  21.  
  22. if (NeatEngine.getOutput(0, i) < 0.5) {
  23. if (player[i][0] > 0) {
  24. player[i][0]--;
  25. }
  26. } else if (NeatEngine.getOutput(0, i) > 0.5) {
  27. if (player[i][0] < gridSize) {
  28. player[i][0]++;
  29. }
  30. }
  31.  
  32. if (NeatEngine.getOutput(1, i) < 0.5) {
  33. if (player[i][1] > 0) {
  34. player[i][1]--;
  35. }
  36. } else if (NeatEngine.getOutput(1, i) > 0.5) {
  37. if (player[i][1] < gridSize) {
  38. player[i][1]++;
  39. }
  40. }
  41.  
  42. if (player[i][0] == food[i][0] && player[i][1] == food[i][1]) {
  43. points[i]++;
  44. pt = newPosition(i);
  45. food[i][0] = pt[0];
  46. food[i][1] = pt[1];
  47. }
  48. for (int j = 0; j < enemies; j++) {
  49. if (player[i][0] == enemy[i][j][0] && player[i][1] == enemy[i][j][1]) {
  50. /*if (points[i] <= 0) {
  51. points[i]--;
  52. } else {
  53. points[i] = 0;
  54. }*/
  55. points[i] --;
  56. pt = newPosition(i);
  57. player[i][0] = pt[0];
  58. player[i][1] = pt[1];
  59. pt = newPosition(i);
  60. enemy[i][j][0] = pt[0];
  61. enemy[i][j][1] = pt[1];
  62. }
  63. }
  64. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement