marantesss / feup-plog-proj Goto Github PK

Welcome page with options:

• PC vs PC
• Player vs PC
• Player vs Player

Every time some action is made, it is necessary to clean the board's boarders to make sure the board stays dynamic

This one is tricky, just start doing it and then ask the professor for help!

Edit: Maybe it is a good idea to try an OOP approach and create a specific module for a piece.

Something like canPieceMove(pawn, NewColNum...) needs to be implemented for all pieces.

Keep reading input and keep on rollin 🎢

Create functions in pieces.pl to add a piece to the board, given coordinates in a (A, 1) and (C, 4) fashion.

Maybe if we do a good job we can do a paper on this and do something cool

• IEEE Conference Paper Template
• CSLN

possivelmente chamar o move quando se coloca a peça no tabuleiro. mas nao sei se funcemina assim. ou fazer um predicado para o canPlace tendo em conta de quando é o peao por exemplo. just tinking

I have no clue how to make this happen, but eventually it will work 👍

Avoid stupid dependency cycles

We didn't do this last time

ALSO: do not read like:

1-c

but read like:

insert column :| 1
insert row :| c

There is no need to verify all cases because the piece will always be in the middle of the board, because after placing the board will always rearrange itself

Adjacent must only be true when comparing pieces of the same color.

1. PrintBoard -> display_game(+Board,+Player)

A google search will get us there, or just use this ✔️

We can delete them, but we still need to add them!

Same as print board from first project with only some slight changes 👍

Given a specific piece and a board, get an array containing the coordinates of all possible cells the piece can be placed

WARNING: Said piece might not be placed in the board, so be careful in the case that it is being placed because it cannot be placed in the opposing king's boarders.

Cool puzzles

• Aztec Math
• Close of Far
• Gap
• Middle Sum
• MNO

Cool Optimization Problems

• meh 😢

Check if each king is surrounded by other pieces (up, down, left and right). Don't forget to add special cases for corners and borders 👍

Clean code yo

This might help, but no prolog version that we know of

If enemy pieces are detected the move is not valid and should be ignored