パッケージsanziqi;
import java.util.Random;
import java.util.Scanner;
public class sanziqi {
public static void main(String [] args){
char myarr [] [] = {{'1'、 '2'、 ' 3 '}、
{' 4 '、' 5 '、' 6 '}、
{' 7 '、' 8 '、' 9 '}};
int m [] [] = new int [3] [3];
/ / (int j = 0; j <m [i] .length; j ++)の
(int i = 0; i <m.length; i ++)の入力位置の決定として使用される配列を特定 m [i] [j] = 0; Random random = new Random(); //ランダムクラスオブジェクトを作成 // (int i = 0 ;;)のゲーム本体{ int n = 0; Scanner scan = new Scanner(System.in);
System.out.println( "チェスの駒の位置を入力してください:");
int N = scan.nextInt();
n = peo(N、myarr、m);
pr(myarr);
// Machine
int number = random.nextInt(9 )+0; //乱数を生成
n = root(number、myarr、m);
pr(myarr);
}
}
//マシンのポーンは
public static int root(int nums、char myarr [] []、int m [ ] []){
//座標変換
int n = 0;
int x =(nums-1)/ 3;
int y =(nums-1)%3;
while(true)
{
if(m [x] [y] != 0){
Random random = new Random();
int N = random.nextInt(9)+0;
x =(N-1)/ 3;
y =(N-1)%3;
}
else
break;
}
if((m [x] [y] == 0)&&
nums <= 9){ myarr [x] [ y] = 'O';
m [x] [y] = 2;
int b = base(nums、m);
if(b == 1){
System.out.println( "You lost");
System。 exit(0);
}
else
n = 1;
}
else {
System.out.println( "入力が正しくありません:");
n = 0;
}
return n;
}
//ピープルドロップ
public static int peo(int N、char myarr [] []、int m [] []){
//座標変換
int n = 0;
int x =(N-1)/ 3;
int y =(N-1 )%3;
//
((m [x] [y] == 0)&& N <= 9){
myarr [x] [y] = '*';
m [x] [y] = 1;
int b = base(N、m);
if(b == 1){
System.out.println( "You won");
System.exit(0);
}
else
n = 1;
}
else {
System .out.println( "wrong input:");
n = 0;
}
return n;
}
//チェス盤の出力
public static void pr(char myarr [] []){
for(int i = 0; i <myarr.length; i ++){
for(int j = 0; j <myarr [i] .length; j ++){
システム。 out.print(myarr [i] [j]);
}
System.out.println();
}
System.out.println();
}
//かどうかを判断します
public static int base(int N、int m [] []){
int x = 0;
switch(N){
ケース1:
if((((m [0] [0] == m [0] [2])&&(m [0] [1] == m [0] [0]))| |((m [0] [0] == m [1] [0])&&(m [0] [0] == m [2] [0]))||((m [0] [0 ] == m [1] [1])&&(m [1] [1] == m [2] [2])))
x = 1;
ブレーク;
ケース2:
if((((m [0] [0] == m [0] [2])&&(m [0] [1] == m [0] [0]))||((m [0] [ 1] == m [1] [1])&&(m [0] [1] == m [2] [1])))
x = 1;
ブレーク;
ケース3:
if((((m [0] [0] == m [0] [2])&&(m [0] [1] == m [0] [0]))||((m [ 0] [2] == m [1] [1])&&(m [0] [2] == m [2] [0]))||((m [0] [2] == m [ 1] [2])&&(m [0] [2] == m [2] [2])))
x = 1;
ブレーク;
ケース4:
if((((m [0] [0] == m [1] [0])&&(m [0] [0] == m [2] [0]))||((m [ 1] [0] == m [1] [1])&&(m [1] [0] == m [1] [2])))
x = 1;
ブレーク;
ケース5:
if((((m [1] [0] == m [1] [1])&&(m [1] [0] == m [1] [2]))||((m [ 0] [1] == m [1] [1])&&(m [0] [1] == m [2] [1]))||((m [0] [0] == m [ 0] [2])&&
x = 1;
ブレーク;
ケース6:
if((((m [1] [0] == m [1] [1])&&(m [1] [0] == m [1] [2]))||((m [ 0] [2] == m [1] [2])&&(m [0] [2] == m [2] [2])))
x = 1;
ブレーク;
ケース7:
if((((m [0] [0] == m [0] [2])&&(m [0] [1] == m [0] [0]))||((m [ 2] [0] == m [2] [1])&&(m [2] [0] == m [2] [2]))||((m [0] [2] == m [ 1] [1])&&(m [0] [2] == m [2] [0])))
x = 1;
ブレーク;
ケース8:
if((((m [2] [0] == m [2] [1])&&(m [2] [0] == m [2] [2]))||((m [ 0] [1] == m [1] [1])&&(m [0] [1] == m [2] [1])))
x = 1;
ブレーク;
ケース9:
if((((m [2] [0] == m [2] [1])&&(m [2] [0] == m [2] [2]))||((m [0] [ 0] == m [1] [1])&&(m [1] [1] == m [2] [2])))
x = 1;
ブレーク;
}
xを返します。
}
}
java jingziqi(詳細は適切に処理されません)
おすすめ
転載: blog.csdn.net/qq_36595497/article/details/105459284
おすすめ
ランキング