COSC 1285: Algorithms and Analysis - Hangman - IT Assignment Help

Assignment Task:

Introduction 

Hangman is a popular children 2-player game, where one player selects a word, phrase or sentence and the other player guesses this by making a number of single letter guesses. Each time the guessing player makes an incorrect guess (either letter or the whole word/phrase/sentence), a part is added to a diagram (usually a hangman). The game ends when either the guessing player guesses all the letters of the word correctly, guesses the word/phrase/sentence correctly, or the diagram is complete. In this assignment you will implement algorithms for the guessing player, that can solve hangman games and its variants. 

1 Learning Outcomes 

This assessment relates to 3 learning outcomes of the course which are: 

• CLO 1: Compare, contrast, and apply the key algorithmic design paradigms: brute force, divide and conquer, decrease and conquer, transform and conquer, greedy, dynamic programming and iterative improvement; 

• CLO 3: Define, compare, analyse, and solve general algorithmic problem types: sorting, searching, graphs and geometric; and 

• CLO 5: Implement, empirically compare, and apply fundamental algorithms and data structures to real-world problems. 

Background 

Hangman 

In Hangman, the guessing player is given a word, phrase or sentence to guess. The length of the word, phrase and sentence are given, and the guessing player makes a number of single letter guesses to guess that unknown word, phrase and sentence. If a guess is correct, the guessed letter in the unknown word will be revealed. If the guess is incorrect, a piece is added to a drawing (typically a hangman), and if the hangman drawing is complete, the guessing player loses.

Tasks 

The assignment is broken up into a number of tasks. Apart from Task A that should be completed initially, all other tasks can be completed in an order you are more comfortable with. Task D is considered a high distinction task and hence we suggest to tackle this after you have completed the other tasks. 

Task A: Implement Random guessing (5 marks) 

To help to understand the problem and the challenges involved, the first task is to develop a random guessing approach to Hangman game. 

Task B: Implement Dictionary-Aware Guessing (8 marks) 

In this task, you’ll implement the dictionary-aware guessing strategy. 

Task C: Design and Implement Dictionary-Aware Guessing Strat- egy for Two Word Hangman (5 marks) 

In this task, you’ll design and implement a guessing strategy/algorithm for the two word Hangman variant. 

Task D: Design and Implement an Algorithm for Wheel of For- tune Variant (6 marks) 

In this task, you will implement an algorithm for the Wheel of Fortune Variant. We want you to explore an algorithm for this.

This COSC 1285: IT Assignment has been solved by our IT Experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.

Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.