9 9简单的数独游戏python,python实现数独游戏 java简单实现数独游戏

使用python和java实现数独游戏，有比较才有收获哦。

1、Python版

#--coding:utf-8--

import random

import itertools

from copy import deepcopy

def make_board(m=3):

numbers = list(range(1,m**2+1))

#可能出现的数字为1-9

board = None

#board是数度二维列表

while board is None:

board = get_board(m,numbers)

return board

def get_board(m,numbers):

n = m**2

board = [[None for _ in range(n)] for _ in range(n)]

for i,j in itertools.product(range(n),repeat=2):

i0,j0 = i-i%m,j-j%m

# i,j分别代表的是我们的行和列

# i0和j0代表的是board[i][j]所在的区块的起始位置

random.shuffle(numbers)

#shuffle() 方法将序列的所有元素随机排序。

for x in numbers:

if(x not in board[i]

and all(row[j]!=x for row in board)

and all(x not in row[j0:j0+m]

for row in board[i0:i])):

board[i][j] = x

break

else:#当循环正常结束时会执行else

return None

return board

def print_board(board,m=3):

numbers = list(range(1,m**2+1))

#每一行随机把5个数字变成None

omit = 5 #omit变量掌控着每一行被抹去的数字个数

challange = deepcopy(board)

for i,j in itertools.product(range(omit),range(m**2)):

x = random.choice(numbers) - 1

challange[x][j] = None

spacer = "++-----+-----+-----++-----+-----+-----++-----+-----+-----++"

print(spacer.replace('-','='))

for i,line in enumerate(challange):

print("|| {} | {} | {} || {} | {} | {} || {} | {} | {} ||"

.format(*(cell or ' ' for cell in line)))

#format()函数中的 * 号，则是将所有的 cell 的不同值放入一个元组 tuple 之中，方便format函数调用

if(i+1)%3==0:

print(spacer.replace('-','='))

else:

print(spacer)

return challange

Board = make_board()

print_board(Board)

效果：

2、Java版

package com.jimo;

import java.util.ArrayList;

import java.util.Collections;

import java.util.List;

import java.util.Random;

public class Shudu {

public String[][] make_board(int m) {

String[][] board = null;

int n = m * m;

List numbers = new ArrayList<>();

for (int i = 1; i <= n; i++) {

numbers.add(i);

}

while (board == null) {

board = get_board(m, numbers);

}

return board;

}

private String[][] get_board(int m, List numbers) {

int n = m * m;

String[][] board = new String[n][n];

for (int i = 0; i < n; i++) {

for (int j = 0; j < n; j++) {

boolean ok = true;

// 打乱顺序

Collections.shuffle(numbers);

for (int x = 0; x < n; x++) {

if (isOk(numbers.get(x) + "", board, i, j, m)) {

board[i][j] = numbers.get(x) + "";

ok = false;

break;

}

}

if (ok) {

return null;

}

}

}

return board;

}

public void print_board(String[][] board, int m) {

int n = m * m;

int hard = 5;

String[][] b = new String[n][n];

System.arraycopy(board, 0, b, 0, board.length);

Random rd = new Random();

for (int i = 0; i < hard; i++) {

for (int j = 0; j < n; j++) {

int x = rd.nextInt(9);

b[x][j] = null;

}

}

String spacer = "+-----+-----+-----+-----+-----+-----+-----+-----+-----+";

System.out.println(spacer);

for (int i = 0; i < n; i++) {

for (int j = 0; j < n; j++) {

if (null == board[i][j]) {

System.out.print("| |");

} else {

System.out.print("| " + b[i][j] + " |");

}

}

System.out.println();

System.out.println(spacer);

}

}

/**

* 判断行列和9格里是否重复

*

* @param x

* @param board

* @return

*/

private boolean isOk(String x, String[][] board, int i, int j, int m) {

int i0 = i - i % m, j0 = j - j % m;

int n = m * m;

for (int k = 0; k < n; k++) {

if (x.equals(board[i][k]) || x.equals(board[k][j])) {

return false;

}

}

for (int k = i0; k < i; k++) {

for (int g = j0; g < j0 + m; g++) {

if (board[k][g].equals(x)) {

return false;

}

}

}

return true;

}

public static void main(String[] args) {

Shudu s = new Shudu();

int m = 3;

String[][] b = s.make_board(m);

for (int i = 0; i < 9; i++) {

for (int j = 0; j < 9; j++) {

System.out.print(b[i][j] + " ");

}

System.out.println();

}

s.print_board(b, m);

}

}