How would you formulate a canmove function for a chess game?

Question

0.00/5 (No votes)

See more:

This can move function checks if your piece(comprised of two coordinates on the board created from a class called spot) is on the board(8 by 8 matrix), intended landing spot/area is unoccupied and if it is occupied then it must be by the opposing color.

Below is the spot class I have created.

class spot:

    def spot(self, x, y ,Piece piece):
        self.setX(x)
        self.setY(y)
        self.setPiece(piece)

    def getX(self):
        return self.x

    def getY(self):
        return self.y

    def getPiece(self):
        return self.piece

    def setX(self, x):
        self.x = x

    def setY(self, y):
        self.y = y

    def setPiece(self, piece):
        self.piece = piece

What I have tried:

I have started this function but can't seem to figure out if I should take in one spot or two spots in my function argument. I can't figure out how I'll be able to determine if the piece on the intended landing spot is of the opposing color.

Posted 1-Jul-20 12:05pm

mohamaddibassy123

Updated 1-Jul-20 13:42pm

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Greg Utas · Accepted Answer · 2020-07-01T13:42:00

I am not a Python programmer, so I can't help you with code. However, a few observations.

- You need to know the color of the piece that occupies a square.
- You need two flags for each side, to indicate whether O-O and O-O-O are legal.
- You need to know if an en passant capture is allowed. This could simply be inserted, when it arises, as the first candidate move for whoever is to move next.

If you want to make this efficient

- Get rid of the (x,y) indexing
- Just assign each square a number (a single index)
- Build (when your program initializes) a list of all the squares which a given type of piece, starting on a particular square, could move to on an open board, in the order that those squares would be visited (there will be more than one such list for each type of piece)

You can take it from there.