GithubHelp home page GithubHelp logo

abhinandanvellanki / animal-game Goto Github PK

View Code? Open in Web Editor NEW
0.0 1.0 0.0 18 KB

A grid game consisting of different animals possessing hierarchical power over others. Animals can move around in ways specific and unique to each other. Single-player, round-based game with random movement of animals.

Java 100.00%
java game forest-garden

animal-game's Introduction

import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.Random; import java.util.Scanner;

/**

  • @author abhin This is a program that implements a new forest which has 9
  •     different kinds of animals with unique movement patterns and attack
    
  •     rules
    

*/ class ForestNew { private static ArrayList For = new ArrayList(); private static ArrayList dead = new ArrayList(); private static Board bd = new Board();

public static void main(String args[]) {

	ForestNew obj = new ForestNew();
	obj.run();
}

/**
 * This is the block that handles continuous execution after input is done
 */
private void execute() {
	Scanner scr = new Scanner(System.in);
	String s = "";
	do {
		System.out.print("Press enter to iterate, type 'print' to print the Forest or 'exit' to quit: ");
		s = scr.nextLine();
		switch (s) {
		case "": {
			iterate();
			break;
		}
		case "print": {
			bd.display();
			System.out.println();
			for (Animal q : dead) {
				int[] dp = q.getpos();
				System.out
						.println(q.getClass().getSimpleName() + " died at location (" + dp[0] + "," + dp[1] + ")");
			}
			break;
		}
		default:
			break;
		}
	} while (!s.equals("exit"));
	bd.display();
	System.out.println();
	for (Animal i : For) {
		int[] p = i.getpos();
		System.out.println(i.getClass().getSimpleName() + " is now at location (" + p[0] + "," + p[1] + ")");
	}
	for (Animal i : dead) {
		int[] p = i.getpos();
		System.out.println(i.getClass().getSimpleName() + " died at location (" + p[0] + "," + p[1] + ")");
	}
}

/**
 * This is the block that handles the input and then class the next block of
 * fucntions
 */
private void run() {
	Scanner sc = new Scanner(System.in);
	Random rant = new Random();
	int a;
	bd.display();
	System.out.println();
	do {
		System.out.println("1. Dog (d)");
		System.out.println("2. Fox (f)");
		System.out.println("3. Wolf (w)");
		System.out.println("4. Jaguar (j)");
		System.out.println("5. Lion (l)");
		System.out.println("6. Cat (c)");
		System.out.println("7. Kitten (k)");
		System.out.println("8. Dinosaur (i)");
		System.out.println("9. Turtle (u)");
		System.out.println("What would you like to add to the Forest?");
		System.out.print("Please enter your choice (1-9, or 0 to finish animal input): ");
		a = sc.nextInt();
		if (a == 0) {
			bd.display();
			Collections.sort(For);
			execute();
			break;
		} else {
			int rar = rant.nextInt(14);
			int rac = rant.nextInt(14);
			if (bd.occupied(rar, rac)) {
				do {
					rar = rant.nextInt(14);
					rar = rant.nextInt(14);
				} while (bd.occupied(rar, rac) == true);
			}
			switch (a) {
			case 1: {

				Dog d = new Dog(rar, rac, 'd');
				For.add(d);
				System.out.println("Added Dog at (" + rar + "," + rac
						+ "): Dog is Canine, Canine moves in four directions, one or two steps at a time.");
				bd.update(rar, rac, 'd');
				bd.display();
				break;
			}
			case 2: {
				Fox f = new Fox(rar, rac, 'f');
				For.add(f);
				System.out.println("Added Fox at (" + rar + "," + rac
						+ "): Fox is Canine, Canine moves in four directions, one or two steps at a time.");
				bd.update(rar, rac, 'f');
				bd.display();
				break;
			}
			case 3: {
				Wolf w = new Wolf(rar, rac, 'w');
				For.add(w);
				System.out.println("Added Wolf at (" + rar + "," + rac
						+ "): Wolf is Canine, Canine moves in four directions, one or two steps at a time.");
				bd.update(rar, rac, 'w');
				bd.display();
				break;
			}
			case 4: {
				Jaguar j = new Jaguar(rar, rac, 'j');
				For.add(j);
				System.out.println("Added Jaguar at (" + rar + "," + rac
						+ "): Jaguar is Feline, Feline moves in all eight directions, one step at a time.");
				bd.update(rar, rac, 'j');
				bd.display();
				break;
			}
			case 6: {
				Cat c = new Cat(rar, rac, 'a');
				For.add(c);
				System.out.println("Added Cat at (" + rar + "," + rac
						+ "): Cat is Feline, Feline moves in all eight directions, one step at a time.");
				bd.update(rar, rac, 'c');
				bd.display();
				break;
			}
			case 5: {
				Lion l = new Lion(rar, rac, 'l');
				For.add(l);
				System.out.println("Added Lion at (" + rar + "," + rac
						+ "): Lion is Feline, Feline moves in all eight directions, one step at a time.");
				bd.update(rar, rac, 'l');
				bd.display();
				break;
			}
			case 7: {
				Kitten k = new Kitten(rar, rac, 'k');
				For.add(k);
				System.out.println("Added Kitten at (" + rar + "," + rac
						+ "): Kitten is a type of Cat, Kitten moves in all eight directions, one step at a time with 0.7 probability or it stays in the same position with 0.3 probability.");
				bd.update(rar, rac, 'k');
				bd.display();
				break;
			}
			case 8: {
				Dinosaur i = new Dinosaur(rar, rac, 'b');
				For.add(i);
				System.out.println("Added Dinosaur at (" + rar + "," + rac
						+ "): Dinaosaur moves in four directions, three steps at a time.");
				bd.update(rar, rac, 'i');
				bd.display();
				break;
			}
			case 9: {
				Turtle u = new Turtle(rar, rac, 'u');
				For.add(u);
				System.out.println("Added Turtle at (" + rar + "," + rac
						+ "): Turtle either stays in the same position or moves in four directions, one step at time.");
				bd.update(rar, rac, 'u');
				bd.display();
				break;
			}
			default: {
				System.out.println("Wrong Choice entered, try again.");
				break;
			}
			}
		}
	} while (a != 0);
}

/**
 * @param posa array that stores attacker's position
 * @param posb array that stores position of animal that is being attacked
 * @param pa   index of attacker in the ArrayList
 * @param pi   index of the animal that is being attacked
 * @return returns the result of the attack in boolean form
 */
private boolean action(int[] posa, int[] posb, int pa, int pi) {
	Animal s = For.get(pa);
	Animal q = For.get(pi);
	boolean res = s.attack(q);
	String a1 = s.getClass().getSimpleName();
	String a2 = q.getClass().getSimpleName();
	if (res) {
		dead.add(q);
		For.remove(pi);
		if (s instanceof Dinosaur) {
			bd.update(posb[0], posb[1], 'i');
		}
		else if (s instanceof Cat) {
			bd.update(posb[0], posb[1], 'c');
		} else
			bd.update(posb[0], posb[1], s.getid());
		bd.delete(posa[0], posa[1]);
		System.out.println(a1 + " from (" + posa[0] + ", " + posa[1] + ") attacks " + a2 + " at (" + posb[0] + ", "
				+ posb[1] + ") and wins");
		System.out.println(
				a1 + " moved from (" + posa[0] + ", " + posa[1] + ") to (" + posb[0] + ", " + posb[1] + ")");
		System.out.println(a2 + " dies at (" + posb[0] + ", " + posb[1] + ")");
	} else {
		dead.add(s);
		bd.delete(posa[0], posa[1]);
		For.remove(pa);
		System.out.println(a1 + " from (" + posa[0] + ", " + posa[1] + ") attacks " + a2 + " at (" + posb[0] + ", "
				+ posb[1] + ") and loses");
		System.out.println(a1 + " dies at (" + posa[0] + ", " + posa[1] + ")");
	}
	return res;

}

/**
 * This block is called when user presses enter. It loops through the ArrayList
 * and operates on each animal
 */
private void iterate() {
	for (int i = 0; i < For.size(); i++) {
		Animal s = For.get(i);
		int oldp[] = s.getpos();
		int newp[] = s.move();
		int att = 0;
		boolean mov = false;
		for (int j = 0; j < For.size(); j++) {
			Animal q = For.get(j);
			int[] exp = q.getpos();
			if (newp[2] != -1 && newp[3] != -1 && newp[4] != -1 && newp[5] != -1 && s instanceof Dinosaur) {// dinosaur
				boolean res1 = false;
				boolean res2 = false;
				boolean res3 = false;
				mov = true;
				int firstpo[] = { newp[4], newp[5] };
				int secpo[] = { newp[2], newp[3] };
				int finpo[] = { newp[0], newp[1] };
				if (Arrays.equals(firstpo, exp) && !s.equals(q)) {
					att++;
					res1 = action(oldp, exp, i, j);
					i--;
					if (res1) {
						j++;
					}
				}
				if (Arrays.equals(secpo, exp) && !s.equals(q)) {
					att++;
					res2 = action(oldp, exp, i, j);
					i--;
					if (res2) {
						
						j++;
					}
				}
				if (Arrays.equals(finpo, exp) && !s.equals(q)) {
					att++;
					res3 = action(oldp, exp, i, j);
					i--;
					if (res3) {
						j++;
					}
				}
			}
			if (newp[2] != -1 || newp[3] != -1 && newp[4] == -1 && newp[5] == -1) {// canine has moved two steps
				boolean res1 = false;
				boolean res2 = false;
				mov = true;
				int midpo[] = { newp[2], newp[3] };
				int newpo[] = { newp[0], newp[1] };
				if (Arrays.equals(midpo, exp) && !s.equals(q)) {
					att++;
					res1 = action(oldp, exp, i, j);
					if (res1) {
						j++;
					}
					i--;

				}
				if (Arrays.equals(newpo, exp) && !s.equals(q)) {
					att++;
					res2 = action(oldp, exp, i, j);
					if (res2) {
						j++;
					}
					i--;
				}
			} else {// all other animals || canine has moved one step
				int newpo[] = { newp[0], newp[1] };
				if (Arrays.equals(newpo, exp) && !Arrays.equals(oldp, newpo) && !s.equals(q)) {
					att++;
					boolean res = action(oldp, exp, i, j);
					i--;
				}
				if (!Arrays.equals(oldp, newpo)) {
					mov = true;
				}
			}

		}
		if (mov && att==0) {
			s.update(newp[0], newp[1]);
			if (s instanceof Dinosaur) {
				bd.update(newp[0], newp[1], 'i');
			}
			else if (s instanceof Cat) {
				bd.update(newp[0], newp[1], 'c');
			} else {
				bd.update(newp[0], newp[1], s.getid());
			}
			System.out.println(s.getClass().getSimpleName() + " moved from (" + oldp[0] + ", " + oldp[1] + ") to ("
					+ newp[0] + ", " + newp[1] + ")");
			bd.delete(oldp[0], oldp[1]);
		} else if (!mov && att==0) {
			System.out.println(s.getClass().getSimpleName() + " stayed in (" + oldp[0] + ", " + oldp[1] + ")");
			if (s instanceof Dinosaur) {
				bd.update(newp[0], newp[1], 'i');
			}
			else if (s instanceof Cat) {
				bd.update(newp[0], newp[1], 'c');
			} else
				bd.update(newp[0], newp[1], s.getid());
		}
	}
	bd.display();
	System.out.println();
}

}

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.