Вопрос: я разрабатываю 3D-игру «Крестики-нолики» на Java. Игра представляет собой сетку 4x4x4 с четырьмя слоями, расположенными друг над другом. Каждый «ключ» или ячейка связана с другими, образуя условия выигрыша.
Например:
В первом слое, если я помещаю ' X» во всех ячейках, кроме верхней левой, а затем поместите «X» в верхний левый угол второго слоя, это должно привести к победе.
Игра должна определять выигрыши на всех слоях по горизонтали, по вертикали и по диагонали.
Однако мой код не обнаруживает горизонтальные выигрыши между слоями. Он обнаруживает победы в других направлениях, но не в этом. Не могли бы вы помочь мне определить, почему возникает эта проблема, и предложить какие-либо улучшения для упрощения моих методов checkWin()?
Вот мой код:
import java.util.Scanner;
public class TicTacToe {
Scanner scanner = new Scanner(System.in);
private char[][][] board;
private char currentPlayer;
public TicTacToe() {
board = new char[4][4][4];
currentPlayer = 'X';
initializeBoard();
}
private void initializeBoard() {
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
for (int k = 0; k < 4; k++) {
board[j][k] = ' ';
}
}
}
}
public void printBoard() {
for (int i = 0; i < 4; i++) {
System.out.println("Level " + (i + 1));
for (int j = 0; j < 4; j++) {
for (int k = 0; k < 4; k++) {
System.out.print("[" + board[j][k] + "]");
}
System.out.println();
}
System.out.println();
}
}
public boolean makeMove(int level, int row, int col) {
if (level < 0 || level >= 4 || row < 0 || row >= 4 || col < 0 || col >= 4 || board[level][row][col] != ' ') {
return false;
}
board[level][row][col] = currentPlayer;
return true;
}
public void switchPlayer() {
currentPlayer = (currentPlayer == 'X') ? 'O' : 'X';
}
public boolean checkWin() {
return checkHorizontalWin() || checkVerticalWin() || checkDiagonalWin() ||
checkLevelVerticalWin() || checkLevelHorizontalWin() || checkLevelCrossWin();
}
private boolean checkHorizontalWin() {
for (int level = 0; level < 4; level++) {
for (int row = 0; row < 4; row++) {
if (board[level][row][0] == currentPlayer && board[level][row][1] == currentPlayer &&
board[level][row][2] == currentPlayer && board[level][row][3] == currentPlayer) {
return true;
}
}
}
return false;
}
private boolean checkVerticalWin() {
for (int level = 0; level < 4; level++) {
for (int col = 0; col < 4; col++) {
if (board[level][0][col] == currentPlayer && board[level][1][col] == currentPlayer &&
board[level][2][col] == currentPlayer && board[level][3][col] == currentPlayer) {
return true;
}
}
}
return false;
}
private boolean checkDiagonalWin() {
for (int level = 0; level < 4; level++) {
if (board[level][0][0] == currentPlayer && board[level][1][1] == currentPlayer &&
board[level][2][2] == currentPlayer && board[level][3][3] == currentPlayer) {
return true;
}
if (board[level][0][3] == currentPlayer && board[level][1][2] == currentPlayer &&
board[level][2][1] == currentPlayer && board[level][3][0] == currentPlayer) {
return true;
}
}
return false;
}
private boolean checkLevelVerticalWin() {
for (int row = 0; row < 4; row++) {
for (int col = 0; col < 4; col++) {
if (board[0][row][col] == currentPlayer && board[1][row][col] == currentPlayer &&
board[2][row][col] == currentPlayer && board[3][row][col] == currentPlayer) {
return true;
}
}
}
return false;
}
private boolean checkLevelHorizontalWin() { /* This method might be wrong */
for (int level = 0; level < 4; level++) {
for (int row = 0; row < 4; row++) {
if (board[level][row][0] == currentPlayer && board[level][row][1] == currentPlayer &&
board[level][row][2] == currentPlayer && board[level][row][3] == currentPlayer) {
return true;
}
}
}
return false;
}
private boolean checkLevelCrossWin() {
if (board[0][0][0] == currentPlayer && board[1][1][1] == currentPlayer &&
board[2][2][2] == currentPlayer && board[3][3][3] == currentPlayer) {
return true;
}
if (board[0][0][3] == currentPlayer && board[1][1][2] == currentPlayer &&
board[2][2][1] == currentPlayer && board[3][3][0] == currentPlayer) {
return true;
}
if (board[0][3][0] == currentPlayer && board[1][2][1] == currentPlayer &&
board[2][1][2] == currentPlayer && board[3][0][3] == currentPlayer) {
return true;
}
if (board[0][3][3] == currentPlayer && board[1][2][2] == currentPlayer &&
board[2][1][1] == currentPlayer && board[3][0][0] == currentPlayer) {
return true;
}
return false;
}
public void play() {
boolean gameWon = false;
int level, row, col;
while (!gameWon) {
printBoard();
System.out.println("Player " + currentPlayer + ", enter level (1-4), row (1-4) and column (1-4):");
level = scanner.nextInt() - 1;
row = scanner.nextInt() - 1;
col = scanner.nextInt() - 1;
if (board[level][row][col] != ' ') {
System.out.println("This cell is already occupied! Choose a different cell.");
} else if (makeMove(level, row, col)) {
gameWon = checkWin();
if (!gameWon) {
switchPlayer();
}
} else {
System.out.println("Invalid move, try again.");
}
}
printBoard();
System.out.println("Player " + currentPlayer + " wins!");
scanner.close();
}
}
И мой вывод выглядит следующим образом:
Level 1
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 2
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 3
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 4
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Player X, enter level (1-4) first, row (1-4) then and column (1-4):
1
2
2
Level 1
[ ][ ][ ][ ]
[ ][X][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 2
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 3
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 4
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Player O, enter level (1-4) first, row (1-4) then and column (1-4):
1
1
1
Level 1
[O][ ][ ][ ]
[ ][X][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 2
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 3
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 4
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Player X, enter level (1-4) first, row (1-4) then and column (1-4):
1
3
3
Level 1
[O][ ][ ][ ]
[ ][X][ ][ ]
[ ][ ][X][ ]
[ ][ ][ ][ ]
Level 2
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 3
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 4
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Player O, enter level (1-4) first, row (1-4) then and column (1-4):
2
1
1
Level 1
[O][ ][ ][ ]
[ ][X][ ][ ]
[ ][ ][X][ ]
[ ][ ][ ][ ]
Level 2
[O][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 3
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 4
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Player X, enter level (1-4) first, row (1-4) then and column (1-4):
1
4
4
Level 1
[O][ ][ ][ ]
[ ][X][ ][ ]
[ ][ ][X][ ]
[ ][ ][ ][X]
Level 2
[O][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 3
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 4
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Player O, enter level (1-4) first, row (1-4) then and column (1-4):
3
1
1
Level 1
[O][ ][ ][ ]
[ ][X][ ][ ]
[ ][ ][X][ ]
[ ][ ][ ][X]
Level 2
[O][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 3
[O][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 4
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Player X, enter level (1-4) first, row (1-4) then and column (1-4):
4
1
1
Level 1
[O][ ][ ][ ]
[ ][X][ ][ ]
[ ][ ][X][ ]
[ ][ ][ ][X]
Level 2
[O][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 3
[O][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 4
[X][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Player O, enter level (1-4) first, row (1-4) then and column (1-4):
Подробнее здесь: https://stackoverflow.com/questions/791 ... layers-4x4
3D-игра «Крестики-нолики» не обнаруживает горизонтальные выигрыши между слоями (4x4) [закрыто] ⇐ JAVA
Программисты JAVA общаются здесь
1730630299
Anonymous
Вопрос: я разрабатываю 3D-игру «Крестики-нолики» на Java. Игра представляет собой сетку 4x4x4 с четырьмя слоями, расположенными друг над другом. Каждый «ключ» или ячейка связана с другими, образуя условия выигрыша.
Например:
В первом слое, если я помещаю ' X» во всех ячейках, кроме верхней левой, а затем поместите «X» в верхний левый угол второго слоя, это должно привести к победе.
Игра должна определять выигрыши на всех слоях по горизонтали, по вертикали и по диагонали.
Однако мой код не обнаруживает горизонтальные выигрыши между слоями. Он обнаруживает победы в других направлениях, но не в этом. Не могли бы вы помочь мне определить, почему возникает эта проблема, и предложить какие-либо улучшения для упрощения моих методов checkWin()?
Вот мой код:
import java.util.Scanner;
public class TicTacToe {
Scanner scanner = new Scanner(System.in);
private char[][][] board;
private char currentPlayer;
public TicTacToe() {
board = new char[4][4][4];
currentPlayer = 'X';
initializeBoard();
}
private void initializeBoard() {
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 4; j++) {
for (int k = 0; k < 4; k++) {
board[i][j][k] = ' ';
}
}
}
}
public void printBoard() {
for (int i = 0; i < 4; i++) {
System.out.println("Level " + (i + 1));
for (int j = 0; j < 4; j++) {
for (int k = 0; k < 4; k++) {
System.out.print("[" + board[i][j][k] + "]");
}
System.out.println();
}
System.out.println();
}
}
public boolean makeMove(int level, int row, int col) {
if (level < 0 || level >= 4 || row < 0 || row >= 4 || col < 0 || col >= 4 || board[level][row][col] != ' ') {
return false;
}
board[level][row][col] = currentPlayer;
return true;
}
public void switchPlayer() {
currentPlayer = (currentPlayer == 'X') ? 'O' : 'X';
}
public boolean checkWin() {
return checkHorizontalWin() || checkVerticalWin() || checkDiagonalWin() ||
checkLevelVerticalWin() || checkLevelHorizontalWin() || checkLevelCrossWin();
}
private boolean checkHorizontalWin() {
for (int level = 0; level < 4; level++) {
for (int row = 0; row < 4; row++) {
if (board[level][row][0] == currentPlayer && board[level][row][1] == currentPlayer &&
board[level][row][2] == currentPlayer && board[level][row][3] == currentPlayer) {
return true;
}
}
}
return false;
}
private boolean checkVerticalWin() {
for (int level = 0; level < 4; level++) {
for (int col = 0; col < 4; col++) {
if (board[level][0][col] == currentPlayer && board[level][1][col] == currentPlayer &&
board[level][2][col] == currentPlayer && board[level][3][col] == currentPlayer) {
return true;
}
}
}
return false;
}
private boolean checkDiagonalWin() {
for (int level = 0; level < 4; level++) {
if (board[level][0][0] == currentPlayer && board[level][1][1] == currentPlayer &&
board[level][2][2] == currentPlayer && board[level][3][3] == currentPlayer) {
return true;
}
if (board[level][0][3] == currentPlayer && board[level][1][2] == currentPlayer &&
board[level][2][1] == currentPlayer && board[level][3][0] == currentPlayer) {
return true;
}
}
return false;
}
private boolean checkLevelVerticalWin() {
for (int row = 0; row < 4; row++) {
for (int col = 0; col < 4; col++) {
if (board[0][row][col] == currentPlayer && board[1][row][col] == currentPlayer &&
board[2][row][col] == currentPlayer && board[3][row][col] == currentPlayer) {
return true;
}
}
}
return false;
}
private boolean checkLevelHorizontalWin() { /* This method might be wrong */
for (int level = 0; level < 4; level++) {
for (int row = 0; row < 4; row++) {
if (board[level][row][0] == currentPlayer && board[level][row][1] == currentPlayer &&
board[level][row][2] == currentPlayer && board[level][row][3] == currentPlayer) {
return true;
}
}
}
return false;
}
private boolean checkLevelCrossWin() {
if (board[0][0][0] == currentPlayer && board[1][1][1] == currentPlayer &&
board[2][2][2] == currentPlayer && board[3][3][3] == currentPlayer) {
return true;
}
if (board[0][0][3] == currentPlayer && board[1][1][2] == currentPlayer &&
board[2][2][1] == currentPlayer && board[3][3][0] == currentPlayer) {
return true;
}
if (board[0][3][0] == currentPlayer && board[1][2][1] == currentPlayer &&
board[2][1][2] == currentPlayer && board[3][0][3] == currentPlayer) {
return true;
}
if (board[0][3][3] == currentPlayer && board[1][2][2] == currentPlayer &&
board[2][1][1] == currentPlayer && board[3][0][0] == currentPlayer) {
return true;
}
return false;
}
public void play() {
boolean gameWon = false;
int level, row, col;
while (!gameWon) {
printBoard();
System.out.println("Player " + currentPlayer + ", enter level (1-4), row (1-4) and column (1-4):");
level = scanner.nextInt() - 1;
row = scanner.nextInt() - 1;
col = scanner.nextInt() - 1;
if (board[level][row][col] != ' ') {
System.out.println("This cell is already occupied! Choose a different cell.");
} else if (makeMove(level, row, col)) {
gameWon = checkWin();
if (!gameWon) {
switchPlayer();
}
} else {
System.out.println("Invalid move, try again.");
}
}
printBoard();
System.out.println("Player " + currentPlayer + " wins!");
scanner.close();
}
}
И мой вывод выглядит следующим образом:
Level 1
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 2
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 3
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 4
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Player X, enter level (1-4) first, row (1-4) then and column (1-4):
1
2
2
Level 1
[ ][ ][ ][ ]
[ ][X][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 2
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 3
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 4
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Player O, enter level (1-4) first, row (1-4) then and column (1-4):
1
1
1
Level 1
[O][ ][ ][ ]
[ ][X][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 2
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 3
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 4
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Player X, enter level (1-4) first, row (1-4) then and column (1-4):
1
3
3
Level 1
[O][ ][ ][ ]
[ ][X][ ][ ]
[ ][ ][X][ ]
[ ][ ][ ][ ]
Level 2
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 3
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 4
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Player O, enter level (1-4) first, row (1-4) then and column (1-4):
2
1
1
Level 1
[O][ ][ ][ ]
[ ][X][ ][ ]
[ ][ ][X][ ]
[ ][ ][ ][ ]
Level 2
[O][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 3
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 4
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Player X, enter level (1-4) first, row (1-4) then and column (1-4):
1
4
4
Level 1
[O][ ][ ][ ]
[ ][X][ ][ ]
[ ][ ][X][ ]
[ ][ ][ ][X]
Level 2
[O][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 3
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 4
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Player O, enter level (1-4) first, row (1-4) then and column (1-4):
3
1
1
Level 1
[O][ ][ ][ ]
[ ][X][ ][ ]
[ ][ ][X][ ]
[ ][ ][ ][X]
Level 2
[O][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 3
[O][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 4
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Player X, enter level (1-4) first, row (1-4) then and column (1-4):
4
1
1
Level 1
[O][ ][ ][ ]
[ ][X][ ][ ]
[ ][ ][X][ ]
[ ][ ][ ][X]
Level 2
[O][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 3
[O][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Level 4
[X][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
[ ][ ][ ][ ]
Player O, enter level (1-4) first, row (1-4) then and column (1-4):
Подробнее здесь: [url]https://stackoverflow.com/questions/79152429/3d-tic-tac-toe-game-not-detecting-horizontal-wins-between-layers-4x4[/url]
Ответить
1 сообщение
• Страница 1 из 1
Перейти
- Кемерово-IT
- ↳ Javascript
- ↳ C#
- ↳ JAVA
- ↳ Elasticsearch aggregation
- ↳ Python
- ↳ Php
- ↳ Android
- ↳ Html
- ↳ Jquery
- ↳ C++
- ↳ IOS
- ↳ CSS
- ↳ Excel
- ↳ Linux
- ↳ Apache
- ↳ MySql
- Детский мир
- Для души
- ↳ Музыкальные инструменты даром
- ↳ Печатная продукция даром
- Внешняя красота и здоровье
- ↳ Одежда и обувь для взрослых даром
- ↳ Товары для здоровья
- ↳ Физкультура и спорт
- Техника - даром!
- ↳ Автомобилистам
- ↳ Компьютерная техника
- ↳ Плиты: газовые и электрические
- ↳ Холодильники
- ↳ Стиральные машины
- ↳ Телевизоры
- ↳ Телефоны, смартфоны, плашеты
- ↳ Швейные машинки
- ↳ Прочая электроника и техника
- ↳ Фототехника
- Ремонт и интерьер
- ↳ Стройматериалы, инструмент
- ↳ Мебель и предметы интерьера даром
- ↳ Cантехника
- Другие темы
- ↳ Разное даром
- ↳ Давай меняться!
- ↳ Отдам\возьму за копеечку
- ↳ Работа и подработка в Кемерове
- ↳ Давай с тобой поговорим...
Мобильная версия