Re: Random Naughts and Crosses, Problem Search

From:

Daniel Pitts <newsgroup.spamfilter@virtualinfinity.net>

Newsgroups:

comp.lang.java.help

Date:

Sat, 09 Feb 2008 18:44:06 -0800

Message-ID:

<47ae64f3$0$32500$7836cce5@newsrazor.net>

Patricia Shanahan wrote:

Mark Space wrote:

TheBigPJ wrote:

the large comparision if statement, but no one has a suitable
alternative.

Yeah that "if" is just nasty. I think you even missed one victory
condition. I count seven and there should be eight I think. Replace
it with a method that uses a loop to iterate over possible victory
conditions.

Also, consider making board a byte[3][3], reflecting the two-dimensional
geometry of the real board.

Actually, I would replace it with an 2d enum array.
enum Stroke {
   EMPTY,
   X,
   O;
}
Or better yet, use a map instead:

final class Position {
    final int x;
    final int y;
    public Position(int x, int y) {
      this.x = x;
      this.y = y;
    }
    public long hashCode() { return x + y * 37; }
    public boolean equals(Object o) { return o instanceof Position &&
((Position)o).x == x && ((Position)o).y == y; }
}

Map<Position, Stroke> board;

That would make it easy to iterate over all columns, all rows, and the
two diagonals.

Patricia

Ditto.

--
Daniel Pitts' Tech Blog: <http://virtualinfinity.net/wordpress/>