Skip to content

hirparikh/Team-Project-1

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

CMPE202 Fall 2016 Team Project using a CSUnplugged Activity

Waffle Board Badges

Stories in Backlog Stories in In Ready Stories in In Progress Stories in In Testing Stories in In Review Stories in In Done

PURPOSE OF PROJECT

To teach Minimal Spanning Tree as one of the solutions for graph traversal with minimum cost which is userful in many network designs

HOW TO START THIS GAME

  1. Install openjdk-1.8 on your machine

  2. Install greenfoot on your machine

  3. Start project.greenfoot file from project directory

HOW TO PLAY THIS GAME

  • Start project.greenfoot file from project directory

  • Click run button on bottom left of screen

  • Start clicking play button and go along as screens proceed

  • As a player enter your name and hit Start

  • Game will try to find you an opponent to play against while showing you a waiting screen with proper instructions

  • Orange elements are suggestions for you to pick one from those(Orange elements)

  • Try to pick the paths with minimum weights/values from those which are orange.

  • Game screen will also show you current score of you and your opponent along with his/her name and your total weight pickup till now.

  • If you finish the game with minimum cumulative weight all paths before your opponent does, YOU WIN else YOU LOSE.

  • You can also see current leaderboard by clicking LEADERBOARD button on Win/Lose screen or you can play again by clicking Replay button.

License

This game is released under the MIT License.

Team BrightBuds

Darshit Thesiya

Hiral Parikh

Shruti Padmanabhan

Varsha Kankariya

Vikas Miyani

About

No description, website, or topics provided.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages