import vrml.*;
import vrml.field.*;
import vrml.node.*;
import java.util.Vector;

/**
 * This Class implements Tic-Tac-Toe VRML 2.0 Script Node.
 * @author Seongyong Lim
 * @author sylim@sly.kotel.co.kr
 */

public class TicTacToe extends Script {
  private SFBool newEnabled;
  private Browser browser;
  private MFNode addStone;
  private MFNode removeStone;
  private SFTime checkDelay;
  private SFTime nextDelay;
  private Vector addedNodes = new Vector();
  private boolean[] isFilled;
  private boolean userTurn = true;
  private boolean userCanClick = true;

  public void initialize() {
    SFNode newTouch = (SFNode) getField("newTouch");
    newEnabled = (SFBool)((Node)newTouch.getValue()).getExposedField("enabled");
    addStone = (MFNode) getEventOut("addStone");
    removeStone = (MFNode) getEventOut("removeStone");
    checkDelay = (SFTime) getEventOut("checkDelay");
    nextDelay = (SFTime) getEventOut("nextDelay");
    browser = this.getBrowser();
  }

  private String moveVrml(int position, boolean userTurn) {
    String result = "Transform { translation ";
    if (position == 0) result += " -1 1 .25 ";
    else if (position == 1) result += " -1 0 .25 ";
    else if (position == 2) result += " -1 -1 .25 ";
    else if (position == 3) result += " 0 1 .25 ";
    else if (position == 4) result += " 0 0 .25 ";
    else if (position == 5) result += " 0 -1 .25 ";
    else if (position == 6) result += " 1 1 .25 ";
    else if (position == 7) result += " 1 0 .25 ";
    else if (position == 8) result += " 1 -1 .25 ";
    else return "";
    if (userTurn && userFirst || !userTurn && !userFirst) // Sphere shape
      result += " children [ Shape { geometry Sphere { radius .25 } appearance Appearance { material Material { diffuseColor 1 0 0 }}}]}";
    else // Cone shape
      result += " rotation 1 0 0 1.57 children [ Shape { geometry Cone { bottomRadius .25 height .5 } appearance Appearance { material Material { diffuseColor 0 1 0 }}}]}";
    return result;
  }

  private double currentTime() {
    return (double) System.currentTimeMillis() / 1000;
  }

  private void userClicked(int pos) { // 0 <= pos <= 8
    if (!userCanClick) return;
    if (yourMove(pos)) {
      try {
	BaseNode[] nodes = browser.createVrmlFromString(moveVrml(pos, true));
	addStone.setValue((Node[])nodes);
	addedNodes.addElement(nodes[0]);
      }
      catch (InvalidVRMLSyntaxException ex) {
      }
      checkDelay.setValue(currentTime());
      userCanClick = false;
      userTurn = false;
    }
  }

  private void computerClicked(int pos) { // 0 <= pos <= 8
    try {
      BaseNode[] nodes = browser.createVrmlFromString(moveVrml(pos, false));
      addStone.setValue((Node[])nodes);
      addedNodes.addElement(nodes[0]);
    }
    catch (InvalidVRMLSyntaxException ex) {
    }
    checkDelay.setValue(currentTime());
    userTurn = true;
  }

  private void showMessage(String msg) {
    try {
      BaseNode[] nodes = browser.createVrmlFromString("Transform { translation 0 0 2.3 children [ Shape { geometry Text { string \"" + msg + "\" fontStyle FontStyle { justify [ \"MIDDLE\" \"MIDDLE\" ] size 1 } maxExtent 3 } appearance Appearance { material Material { diffuseColor 1 1 1 } } } ] }");
      addStone.setValue((Node[])nodes);
      addedNodes.addElement(nodes[0]);
    }
    catch (InvalidVRMLSyntaxException ex) {
    }
    newEnabled.setValue(true);
  }

  public void processEvent (Event e) {
    if (e.getName().startsWith("touched")) {
      try {
	int num = Integer.parseInt(e.getName().substring(7));
	userClicked(num-1);
      } catch (NumberFormatException ex) {
      }
    }
    else if (e.getName().equals("checkForWin")) {
      ConstSFBool v = (ConstSFBool)e.getValue();
      if (v.getValue() == false) {
	switch (status()) {
	case WIN:
	  showMessage("You Lose");
	  break;
	case LOSE:
	  showMessage("You Win");
	  break;
	case STALEMATE:
	  showMessage("Stalemate");
	  break;
	default:
	  nextDelay.setValue(currentTime());
	}
      }
    }
    else if (e.getName().equals("nextTurn")) {
      ConstSFBool v = (ConstSFBool)e.getValue();
      if (v.getValue() == false) {
	if (userTurn) {
	  userCanClick = true;
	} else {
	  if (black == 0) // if computer first and first move
	    computerClicked((int)(Math.random() * 9));
	  else
	    computerClicked(myMove());
	}
      }
    }
    else if (e.getName().equals("newGame")) {
      BaseNode[] nodes = new BaseNode[addedNodes.size()];
      for (int i=0; i< addedNodes.size(); i++)
	nodes[i] = (BaseNode) addedNodes.elementAt(i);
      removeStone.setValue((Node[])nodes);
      addedNodes = new Vector();
      newEnabled.setValue(false);
      white = black = 0;
      userFirst = !userFirst;
      userTurn = userFirst;
      nextDelay.setValue(currentTime());
    }
  }

  // TicTacToe logic from JDK demo applet by Arthur van Hoff
    /**
     * White's current position. The computer is white.
     */
    int white;

    /**
     * Black's current position. The user is black.
     */
    int black;

    /**
     * The squares in order of importance...
     */
    final static int moves[] = {4, 0, 2, 6, 8, 1, 3, 5, 7};

    /**
     * The winning positions.
     */
    static boolean won[] = new boolean[1 << 9];
    static final int DONE = (1 << 9) - 1;
    static final int OK = 0;
    static final int WIN = 1;
    static final int LOSE = 2;
    static final int STALEMATE = 3;

    /**
     * Mark all positions with these bits set as winning.
     */
    static void isWon(int pos) {
	for (int i = 0 ; i < DONE ; i++) {
	    if ((i & pos) == pos) {
		won[i] = true;
	    }
	}
    }

    /**
     * Initialize all winning positions.
     */
    static {
	isWon((1 << 0) | (1 << 1) | (1 << 2));
	isWon((1 << 3) | (1 << 4) | (1 << 5));
	isWon((1 << 6) | (1 << 7) | (1 << 8));
	isWon((1 << 0) | (1 << 3) | (1 << 6));
	isWon((1 << 1) | (1 << 4) | (1 << 7));
	isWon((1 << 2) | (1 << 5) | (1 << 8));
	isWon((1 << 0) | (1 << 4) | (1 << 8));
	isWon((1 << 2) | (1 << 4) | (1 << 6));
    }

    /**
     * Compute the best move for white.
     * @return the square to take
     */
    int bestMove(int white, int black) {
	int bestmove = -1;
	
      loop:
	for (int i = 0 ; i < 9 ; i++) {
	    int mw = moves[i];
	    if (((white & (1 << mw)) == 0) && ((black & (1 << mw)) == 0)) {
		int pw = white | (1 << mw);
		if (won[pw]) {
		    // white wins, take it!
		    return mw;
		}
		for (int mb = 0 ; mb < 9 ; mb++) {
		    if (((pw & (1 << mb)) == 0) && ((black & (1 << mb)) == 0)) {
			int pb = black | (1 << mb);
			if (won[pb]) {
			    // black wins, take another
			    continue loop;
			}
		    }
		}
		// Neither white nor black can win in one move, this will do.
		if (bestmove == -1) {
		    bestmove = mw;
		}
	    }
	}
	if (bestmove != -1) {
	    return bestmove;
	}

	// No move is totally satisfactory, try the first one that is open
	for (int i = 0 ; i < 9 ; i++) {
	    int mw = moves[i];
	    if (((white & (1 << mw)) == 0) && ((black & (1 << mw)) == 0)) {
		return mw;
	    }
	}

	// No more moves
	return -1;
    }

    /**
     * User move.
     * @return true if legal
     */
    boolean yourMove(int m) {
	if ((m < 0) || (m > 8)) {
	    return false;
	}
	if (((black | white) & (1 << m)) != 0) {
	    return false;
	}
	black |= 1 << m;
	return true;
    }

    /**
     * Computer move.
     * @return true if legal
     */
    int myMove() {
	if ((black | white) == DONE) {
	    return -1;
	}
	int best = bestMove(white, black);
	white |= 1 << best;
	return best;
    }

    /**
     * Figure what the status of the game is.
     */
    int status() {
	if (won[white]) {
	    return WIN;
	}
	if (won[black]) {
	    return LOSE;
	}
	if ((black | white) == DONE) {
	    return STALEMATE;
	}
	return OK;
    }

    /**
     * Who goes first in the next game?
     */
    boolean userFirst = true;

}