0
HI, I HAVE A PROBLEM WITH MY POJECT
I HAVE A CHESSBOARD WHERE THERE ARE SOME PAWNS AND SOME FLAGS, I DONâT KNOW HOW tO CALCULATE THE FASTER ROUTE FOR THE PAWNS TO REACH THE NEAREST FLAG. HOW CAN I DO? THANKS IN ADVANCE
1 Answer
0
It doesn't seem like a simple question to respond here in a few lines.
You must make a class for your pawns. Coordinates must be an attribute and move a method. Your Flags can be another Class. And if a paw reach the flag a boolean attribute of the pawns.
Start to work, make some code and make questions here.
Don't use uppercase in all your question, in internet is like screaming.