我想用Java实现国际象棋作为练习我正在尝试实现一些基本的部分,比如片段移动,但是我不能用这种方式编写这个方法,如果你想改变你的片段位置,你必须知道那是另一个一路走到新的位置(我们知道只是骑士不能跳过其他部分).

另一个问题是城堡移动的实施.

相关代码：

片：

enum Color {BLACK , WHITE}

enum TYPE {ROOK , BISHOP , KNIGHT , QUEEN , KING , PAWN}

public abstract class Piece {

private boolean available;

private char x;

private int y;

Color color;

TYPE type;

public Piece(boolean available, char x, int y, Color color, TYPE type) {

this.available = available;

this.x = x;

this.y = y;

this.color = color;

this.type = type;

}

public boolean validateMove(ChessBoard board,char fromX, int fromY, char toX, int toY) {

if(toX == fromX && toY == fromY)

return false;

if(getX() != fromX || toY != fromY)

return false;

if(toX - 'a' < 0 || toX - 'a' > 7 || toY < 0 || toY > 7 || fromX - 'a' < 0 || fromX - 'a' > 7 || fromY < 0 || fromY > 7)

return false;

protectingTheWay(board);

return true;

}

(and all it’s getter and setter).

主教：

public class Bishop extends Piece {

public Bishop(boolean available, char x, int y, Color color, TYPE type) {

super(available, x, y, color, type);

}

@Override

public boolean validateMove(ChessBoard board,char fromX, int fromY, char toX, int toY) {

if(super.validateMove(board,fromX, fromY, toX, toY) == false)

return false;

if( abs(toX - 'a' - (fromX - 'a')) == abs(toY - fromY) )

return true;

return false;

}

}

骑士：

public class Knight extends Piece {

public Knight(boolean available, char x, int y, Color color, TYPE type) {

super(available, x, y, color, type);

}

@Override

public boolean validateMove(ChessBoard board,char fromX, int fromY, char toX, int toY) {

if( super.validateMove(board,fromX, fromY, toX, toY) == false)

return false;

if(toX - 'a' != fromX - 'a' - 1 || toX - 'a' != fromX - 'a' + 1 || toX - 'a' != fromX - 'a' + 2 || toX - 'a' != fromX - 'a' - 2)

if(toY != fromY - 2 || toY != fromY + 2 || toY != fromY - 1 || toY != fromY + 1)

return false;

return true;

}

}

和其他作品.

解决方法:

这听起来像是一个很酷的练习,对我来说,听起来你实际上是一个设计问题,而不是编码问题.即使你不是熟悉设计模式和SOLID的OOP专家,甚至是Long中的多少位,你通常可以通过编写一些描述你正在构建的系统的文本来改善面向对象的应用程序,然后记下该文中的各种名词和动词.

因此,让我们从一个简单(显然不全面)的问题域描述示例开始：

Chess is a game, played on a board called a chessboard, with the goal

of capturing a specific piece on the opposing player’s side – their

king. There are two players, one playing white and the other playing

black. Each player starts with a fixed number of pieces of various

types (king is among those). Each piece can only move in predefined

ways. The game starts when the white player makes a legal move, and

each player takes turns moving one piece at a time until the game

ends. The game can end when one in put in check-mate (meaning their

own king will be captured on the next move by their opponent and the

king cannot escape, block, or eliminate the threat of capture), when

there is a draw (where neither player can possibly capture the

opponent’s king), or when one player surrenders to the other (because

… reasons).

如果您查看该描述,请记下各种名词和动词.名词是程序中的候选对象,动词是候选操作(方法).

在上面的代码中,我看到了代表一些棋子和棋盘的对象.将您的内容与上面的简单描述进行比较,并问自己缺少哪些其他可能的对象.一个有趣的含义可能是您是否将国际象棋移动视为潜在对象或其他对象可以执行的操作.

具体到您的问题 – 您将如何根据拟议系统中的其他对象和方法定义城堡？铸造肯定是一种特定类型的移动,并且对于哪些碎片可以参与其中,开始和结束的位置以及可以执行它的方向存在限制(向左铸造！=右侧铸造).

标签：java,oop,chess

来源： https://codeday.me/bug/20190622/1265536.html