Thread: MATLAB Reversi Coding

Hey, now I know what you're thinking, "This is a java forum, why are you posting here about MATLAB you crazed lunatic?"
Well, I need help with an assignment, and MATLAB is based off of java, so I figured that I might be able to get some help.

If you know any MATLAB, I would be especially thankful for your help.


Anyway...



I have been given an assignment in which I need to remake the game Reversi/Othello in MatLAB using an 8x8 matrix where black is 1 and white is -1, and have a functional GUI.

I have been able to do the GUI etc, by myself, but when I reach the point where I need to allow for only valid moves, I become a little stuck.

I was curious if any of you would know of a way in which that could be done, because I've hit a road block. Essentially I need to scan all 8 directions of the matrix from the centre point, and find a valid combination of player_number*-1, in a row which end in a player_number (where player_number is the current players turn), but I am not sure how to accomplish this.


Again, thanks for your time.

Welcome Aruhi

While it is okay to post questions about other languages, we do ask that you post in an appropriate location on the forum.

Anyway, the problem you face is not related to any specific language, you just need an algorithm to do what you want to do.
To lower the complexity, work on one of the 8 directions at a time.

Imagine a 2d grid, or draw it on paper. Say it is 10x10 for this example. x is positive to the right and let's assume y is positive going up.
Given point (3,4) what is the location of the element above (3,4)?
In general terms, it is at (x, y+1) from (3,4) or for this example it is at (3,5)

Work out the steps needed to find the elements on each side of the element in question. Do not forget the case where the given element is on an edge or corner, where there may be no element next door in one or more directions