Package de.axxeed.animosy.model

Examples of de.axxeed.animosy.model.Node

486
487
488
489
490
491
492
493
494
495
496
  return compare(this,b);
    }

    public Move moveMrX()
    {
  Node bestNode=bestMove();
  int type=MrX.changePosition(bestNode);
  int pos=MrX.getPosition().getPosition();
  currentMoves++;
  return (new Move(pos,type));
    }
View Full Code Here
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
    /**Checks if the detective can make a move or not
     * @return true if the detective can move,false if the detective is stranded
     */
    private boolean canMove(VirtualBoard board, int detNo)
    {
        Node n=board.getDetectives()[detNo].getPosition();
        // log.debug("Detective #"+detNo+", Node: "+n+" on board ("+board.hashCode()+")");
        Link []lk=n.getLinks();
        boolean canMove=false;
        for(int i=0;i<lk.length;i++)
        {
      boolean canGoToThisNode=true;
      Node toNode=lk[i].getToNode();
      Detective[] det=Manager.getGame().getBoard().getDetectives();
      for(int j=0;j<det.length;j++)
    if (toNode.equals(det[j].getPosition())) canGoToThisNode=false;

            int t=lk[i].getType();
            switch(t)
            {
                case TAXI:if(getDetectives()[detNo].getTaxiTickets()<=0) if(canGoToThisNode) canGoToThisNode=false;
View Full Code Here
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
     */
    private TreeSet getPossibleMoves(VirtualBoard board, int detNo)
    {
  if(!canMove(board, detNo)) return null;
  boolean added=false;
  Node n=board.getDetectives()[detNo].getPosition();
  Link []lk=n.getLinks();
      TreeSet possibleMoves=new TreeSet();
  for(int i=0;i<lk.length;i++)
  {
      boolean canGoToThisNode=true;
      Node toNode=lk[i].getToNode();
      Detective[] det=Manager.getGame().getBoard().getDetectives();
      for(int j=0;j<det.length;j++)
    if(toNode.equals(det[j].getPosition())) canGoToThisNode=false;

      int t=lk[i].getType();
        switch(t)
        {
            case  TAXI:if(getDetectives()[detNo].getTaxiTickets()<=0) if(canGoToThisNode) canGoToThisNode=false;
                       break;
            case   BUS:if(getDetectives()[detNo].getBusTickets()<=0) if(canGoToThisNode) canGoToThisNode=false;
                        break;
            case    UG:if(getDetectives()[detNo].getUndergroundTickets()<=0) if(canGoToThisNode) canGoToThisNode=false;
                  break;
            case BLACK:canGoToThisNode=false;
                  break;
        }
      if(canGoToThisNode)  possibleMoves.add(new Move(toNode.getPosition(),t));
  }
  return possibleMoves;
    }
View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
34
    /**This method makes a random move for the MrX
     * @return a random legal Node position for the MrX
   * @see de.axxeed.animosy.ai.MrXAbstract#getMove()
     */
  public Node getMove() {
    Node n=Manager.getGame().getBoard().getMrX().getPosition();
    Node toNode=n;
    Link[] lk=n.getLinks();
    // int noOfNodes=lk.length;
    boolean done=false;
    while(!done) {
      int rnd=(int)(lk.length*Math.random());
 
View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
34
     */
    protected boolean isLegalMove(Node to)
    {
        boolean canMove=true;
        for(int i=0;i<Manager.getGame().getBoard().getDetectives().length;i++) {
      Node n=Manager.getGame().getBoard().getDetectives()[i].getPosition();
      if(n.getPosition()==to.getPosition()) {
        canMove=false;
      }
      }
        return canMove;
    }
View Full Code Here
TOP

Related Classes of de.axxeed.animosy.model.Node

  • de.axxeed.animosy.ai.MaxDist
  • de.axxeed.animosy.ai.MrX
  • de.axxeed.animosy.ai.MrXAbstract
  • de.axxeed.animosy.ai.RandomMrX
  • de.axxeed.animosy.ai.VirtualBoard
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.