Sweep

一：团队组成

团队名称：Sweep

团队成员介绍：陈玉婷，彭佳妮，罗梅丽

任务分配：

陈玉婷：文件管理，及扫雷游戏算法实现，画UML图

彭佳妮：GUI登陆界面设置，用户密码验证及其监听，写博客

罗梅丽：GUI登陆界面设置，写博客

团队成员课程设计博客链接
成员	博客链接
陈玉婷（组长）	https://home.cnblogs.com/u/chenyutin
彭佳妮
罗梅丽

二:项目Git地址及提交记录

Git地址

提交记录

三：项目简介

游戏介绍：

扫雷游戏介绍：

《扫雷》是一款大众类的益智小游戏。游戏目标是在最短的时间内根据点击格子出现的数字找出所有非雷格子，同时避免踩雷，踩到一个雷即全盘皆输。

游戏设定：

游戏区包括雷区，确定大小的矩形雷区中随机布置一定数量的地雷(初级为9*9个方块9个雷，中级为14*14个方块14个雷，高级为16*16个方块16个雷，玩家需要尽快找出雷区中的所有不是地雷的方块，而不许踩到地雷。

项目功能架构图与主要功能流程图

功能流程图

功能构架图

项目运行演示

项目关键代码

界面显示模块

//登陆界面设置

        setSize(496, 557);
        setLayout(new GridLayout(2, 1));
        // JMenuBar bar=new JMenuBar();
        HomePanel panelN = new HomePanel("2018-01-10_12-55-41.gif");
        HomePanel panelS = new HomePanel("ApplicationFrameHost_2018-01-10_13-37-17.png");
        panelN.setLayout(new FlowLayout());
        JButton button=new JButton();
        button.setIcon(new ImageIcon("ApplicationFrameHost_2018-01-10_13-39-56.png"));
        //button.setOpaque(false);  //设置控件透明
        button.setBorder(null);   //设置边框
        button.setContentAreaFilled(false);   //设置控件透明
        
        button.addActionListener(new ActionListener() {
            @Override
            public void actionPerformed(ActionEvent arg0) {
                System.exit(0);
            }
        });
//键盘监听
KeyListener key_Listener = new KeyListener()
        {
            public void keyTyped(KeyEvent e) {}
            public void keyReleased(KeyEvent e){}
            public void keyPressed(KeyEvent e){
                if(e.getKeyChar() == KeyEvent.VK_ENTER )   
                {
                    String name = usenameField.getText();
                    String word = new String(passwordField.getPassword());
                    if(judge(name,word) == 0) 
                        JOptionPane.showMessageDialog(null, "用户名不存在!");
                    else if(judge(name,word) == -1)
                        JOptionPane.showMessageDialog(null, "密码错误!");
                    else {
                        Selection selection=new Selection(file);
                        MFrame.this.dispose();
                    }
                    try {
                        file.setFileName(usenameField.getText());
//                        Selection selection=new Selection(file);
                    } catch (Exception e1) {
                        // TODO Auto-generated catch block
                        e1.printStackTrace();
                    }
                }
            }
        };
        
        passwordField.addKeyListener(key_Listener);

算法模块

public void findZero(int i, int j) {
        if (hiddenmap[i][j] != 0) {
            if (map[i][j] == 0) {
                hiddenmap[i][j] = 0;

                if (i == 0) {
                    if (j == 0) {
                        if (map[i][j + 1] != 0 && map[i][j + 1] != 9)
                            hiddenmap[i][j + 1] = map[i][j + 1];
                        if (map[i + 1][j] != 0 && map[i + 1][j] != 9)
                            hiddenmap[i + 1][j] = map[i + 1][j];
                    } 
                    else if (j == length - 1) {
                        if (map[i][j - 1] != 0 && map[i][j - 1] != 9)
                            hiddenmap[i][j - 1] = map[i][j - 1];
                        if (map[i + 1][j] != 0 && map[i + 1][j] != 9)
                            hiddenmap[i + 1][j] = map[i + 1][j];
                    } 
                    else {
                        if (map[i][j - 1] != 0 && map[i][j - 1] != 9)
                            hiddenmap[i][j - 1] = map[i][j - 1];
                        if (map[i + 1][j] != 0 && map[i + 1][j] != 9)
                            hiddenmap[i + 1][j] = map[i + 1][j];
                        if (map[i][j + 1] != 0 && map[i][j + 1] != 9)
                            hiddenmap[i][j + 1] = map[i][j + 1];
                    }
                }

                if (i == width - 1) {
                    if (j == 0) {
                        if (map[i][j + 1] != 0 && map[i][j + 1] != 9)
                            hiddenmap[i][j + 1] = map[i][j + 1];
                        if (map[i - 1][j] != 0 && map[i - 1][j] != 9)
                            hiddenmap[i - 1][j] = map[i - 1][j];
                    } else if (j == length - 1) {
                        if (map[i - 1][j] != 0 && map[i - 1][j] != 9)
                            hiddenmap[i - 1][j] = map[i - 1][j];
                        if (map[i][j - 1] != 0 && map[i][j - 1] != 9)
                            hiddenmap[i][j - 1] = map[i][j - 1];
                    } else {
                        if (map[i][j + 1] != 0 && map[i][j + 1] != 9)
                            hiddenmap[i][j + 1] = map[i][j + 1];
                        if (map[i - 1][j] != 0 && map[i - 1][j] != 9)
                            hiddenmap[i - 1][j] = map[i - 1][j];
                        if (map[i][j - 1] != 0 && map[i][j - 1] != 9)
                            hiddenmap[i][j - 1] = map[i][j - 1];
                    }
                }

                if (j == 0) {
                    if (i != 0 && i != width - 1) {
                        if (map[i - 1][j] != 0 && map[i - 1][j] != 9)
                            hiddenmap[i - 1][j] = map[i - 1][j];
                        if (map[i + 1][j] != 0 && map[i + 1][j] != 9)
                            hiddenmap[i + 1][j] = map[i + 1][j];
                        if (map[i][j + 1] != 0 && map[i][j + 1] != 9)
                            hiddenmap[i][j + 1] = map[i][j + 1];
                    }
                }
                if (j == length - 1) {
                    if (i != 0 && i != width - 1) {
                        if (map[i - 1][j] != 0 && map[i - 1][j] != 9)
                            hiddenmap[i - 1][j] = map[i - 1][j];
                        if (map[i + 1][j] != 0 && map[i + 1][j] != 9)
                            hiddenmap[i + 1][j] = map[i + 1][j];
                        if (map[i][j - 1] != 0 && map[i][j - 1] != 9)
                            hiddenmap[i][j - 1] = map[i][j - 1];
                    }
                }
                if (i != 0 && i != width - 1 && j != 0 && j != length - 1) {
                    if (map[i][j + 1] != 0 && map[i][j + 1] != 9)
                        hiddenmap[i][j + 1] = map[i][j + 1];
                    if (map[i + 1][j] != 0 && map[i + 1][j] != 9)
                        hiddenmap[i + 1][j] = map[i + 1][j];
                    if (map[i][j - 1] != 0 && map[i][j - 1] != 9)
                        hiddenmap[i][j - 1] = map[i][j - 1];
                    if (map[i - 1][j] != 0 && map[i - 1][j] != 9)
                        hiddenmap[i - 1][j] = map[i - 1][j];
                }

                if (j >= 1)
                    findZero(i, j - 1);
                if (i >= 1)
                    findZero(i - 1, j);
                if (j <= getLength() - 2)
                    findZero(i, j + 1);
                if (i <= getWidth() - 2)
                    findZero(i + 1, j);
            }
        }
    }

ObjectInputStream readFile;
            if (file.isNewOne() == false) {
                try {
                    readFile = new ObjectInputStream(new FileInputStream(file.getFileName()));
                    this.minefield = (Minefield) readFile.readObject();
                    readFile.close();
                    if (minefield.isBoom() == true) {
                        boom.play();
                        upset.play();
                    } else {
                        playGame.play();
                    }
                } catch (FileNotFoundException e) {   //不存在上局时，自动生成一局
                    this.minefield = new Minefield(file.getWidth(), file.getLength(), file.getLambnumber());
                    playGame.play();
//                        JOptionPane.showMessageDialog(null, "您还未开始游戏，不存在上局哦！");
//                        e.printStackTrace();
                } catch (IOException e) {
//                        e.printStackTrace();
                }
                
            }