1. Java / Говнокод #13517

    +58

    1. 01
    2. 02
    3. 03
    4. 04
    5. 05
    6. 06
    7. 07
    8. 08
    9. 09
    10. 10
    11. 11
    12. 12
    13. 13
    14. 14
    15. 15
    16. 16
    17. 17
    18. 18
    19. 19
    20. 20
    21. 21
    22. 22
    23. 23
    24. 24
    25. 25
    26. 26
    27. 27
    28. 28
    29. 29
    30. 30
    31. 31
    32. 32
    33. 33
    34. 34
    35. 35
    36. 36
    37. 37
    38. 38
    39. 39
    40. 40
    41. 41
    42. 42
    43. 43
    44. 44
    45. 45
    46. 46
    47. 47
    48. 48
    49. 49
    50. 50
    51. 51
    52. 52
    53. 53
    54. 54
    55. 55
    56. 56
    57. 57
    58. 58
    59. 59
    60. 60
    61. 61
    62. 62
    63. 63
    64. 64
    65. 65
    66. 66
    67. 67
    68. 68
    69. 69
    70. 70
    71. 71
    72. 72
    73. 73
    74. 74
    75. 75
    76. 76
    77. 77
    78. 78
    79. 79
    80. 80
    81. 81
    82. 82
    83. 83
    84. 84
    85. 85
    86. 86
    87. 87
    88. 88
    private void getPCTurn(char s){
        int done = 0;
        System.out.println("Now the turn of " + s +" \n Computer thinking...");
        analysis:
            while(done == 0){
                int numbX;
                for(int i = 0; i < field.length; i++){
                     numbX = 0; // check horisontals for 00
                    for (int j = 0; j < field.length; j++){
                        if (field[i][j] == s){
                            numbX++;
                        }
                        if (numbX == (field.length-1)){
                            for (j = 0; j < field.length; j++){
                                if (field[i][j] == DEF_FIELD){
                                    field[i][j] = s;
                                    done++;
                                    break analysis;
                                }
                            }
                        }
                    }
                    numbX = 0; // check verticals for 00
                    for (int j = 0; j < field.length; j++){
                        if (field[j][i] == s){
                            numbX++;
                        }
                        if (numbX == (field.length-1)){
                            for (j = 0; j < field.length; j++){
                                if (field[j][i] == DEF_FIELD){
                                    field[j][i] = s;
                                    done++;
                                    break analysis;
                                }
                            }
                        }
                    }
                }
                 numbX = 0; //check diagonal for 00
                    for (int i = 0;i < field.length; i++){
                        if (field[i][i] == s){
                            numbX++;
                        }
                        if (numbX == (field.length-1)){
                            for (i = 0;i < field.length; i++){
                                if (field[i][i] == DEF_FIELD){
                                    field[i][i] = s;
                                    done++;
                                    break analysis;
                                }
                            }
                        }
                    }
                    numbX = 0; // check second diagonal for 00
                    for (int i = (field.length - 1);i >= 0; i--){
                        int j = (field.length - 1)-i;
                        if (field[i][j] == s){
                            numbX++;
                        }
                        if (numbX == (field.length-1)){
                            for (i = (field.length - 1);i >= 0; i--){
                                j = (field.length - 1)-i;
                                if (field[i][j] == DEF_FIELD){
                                    field[i][j] = s;
                                    done++;
                                    break analysis;
                                }
                            }
                        }
                    }
                for(int i = 0; i < field.length; i++){
                    numbX = 0; // check horisontals for XX
                    for (int j = 0; j < field.length; j++){
                        if (field[i][j] != s && field[i][j] != DEF_FIELD){
                            numbX++;
                        }
                        if (numbX == (field.length-1)){
                            for (j = 0; j < field.length; j++){
                                if (field[i][j] == DEF_FIELD){
                                    field[i][j] = s;
                                    done++;
                                    break analysis;
                                }
                            }
                        }
                    }

// to be continued ...

    "Незамысловатая" реализация искусственного интеллекта для игры "Крестики-Нолики" от sv1979.
    Оригинал -> https://github.com/sv1979/svhome1/blob/master/src/TicTacToe/Field.java

    Запостил: W1nneR, 31 Июля 2013

    Комментарии (1) RSS

    Добавить комментарий