title: Using a Data Structure for Rock, Paper, Scissors
body: <p>Due to time constraints when it came to coming up with an idea for an assignment, I decided to choose rock, paper, scissors. I have to implement a rock, paper, scissors program in Java using either queues, stacks, heaps, trees, graphs, or search trees. What do you think would be the best method for this situation? I am leaning towards using queues but I would like to hear some input.</p>