Find Jobs
Hire Freelancers

ML model Hangman

₹600-1500 INR

Closed
Posted about 1 year ago

₹600-1500 INR

Paid on delivery
Instruction: When a user plays Hangman, the server first selects a secret word at random from a list. The server then returns a row of underscores (space separated)—one for each letter in the secret word—and asks the user to guess a letter. If the user guesses a letter that is in the word, the word is redisplayed with all instances of that letter shown in the correct positions, along with any letters correctly guessed on previous turns. If the letter does not appear in the word, the user is charged with an incorrect guess. The user keeps guessing letters until either (1) the user has correctly guessed all the letters in the word or (2) the user has made six incorrect guesses. You are required to write a "guess" function that takes current word (with underscores) as input and returns a guess letter. You will use the API codes below to play 1,000 Hangman games. You have the opportunity to practice before you want to start recording your game results. Your algorithm is permitted to use a training set of approximately 250,000 dictionary words. Your algorithm will be tested on an entirely disjoint set of 250,000 dictionary words. Please note that this means the words that you will ultimately be tested on do NOT appear in the dictionary that you are given. You are not permitted to use any dictionary other than the training dictionary we provided. This requirement will be strictly enforced by code review. You are provided with a basic, working algorithm. This algorithm will match the provided masked string (e.g. a _ _ l e) to all possible words in the dictionary, tabulate the frequency of letters appearing in these possible words, and then guess the letter with the highest frequency of appearence that has not already been guessed. If there are no remaining words that match then it will default back to the character frequency distribution of the entire dictionary. This benchmark strategy is successful approximately 18% of the time. Your task is to design an algorithm that significantly outperforms this benchmark.
Project ID: 35863677

About the project

5 proposals
Remote project
Active 1 yr ago

Looking to make some money?

Benefits of bidding on Freelancer

Set your budget and timeframe
Get paid for your work
Outline your proposal
It's free to sign up and bid on jobs
5 freelancers are bidding on average ₹4,520 INR for this job
User Avatar
Hi, I’ve worked on hangman game before also. I can surely code on this. But please reply if you accept my budget, because it’s not that easy to code
₹6,000 INR in 3 days
5.0 (25 reviews)
5.6
5.6
User Avatar
Hello, I am very familiarized with the requirements of your projects. And it can be done really fast. Let's connect over chat to discuss more on this. Thanks
₹1,050 INR in 7 days
5.0 (4 reviews)
3.2
3.2
User Avatar
Hi, I am a Python developer with around 2 years of experience and I have decent understranding of Artificial Intelligence. I have some ideas on how to develop a machine learning algorithm for the Hangman game and I would like to put them to use. I am eager to help. I would like to talk about the details of your project. Have a nice day. Ismail Ergun.
₹4,500 INR in 7 days
5.0 (1 review)
1.1
1.1
User Avatar
One approach to improve the performance of the algorithm would be to prioritize certain letters based on their position in the word. For example, if the letter "e" appears most frequently in the possible words but is already in the correct position in the masked word, it would make more sense to guess a letter that appears less frequently but is not in the correct position. Additionally, taking into account the number of incorrect guesses made so far and adjusting the strategy accordingly could also improve performance. For example, if there are only a few incorrect guesses remaining, it might make more sense to guess more conservatively and prioritize letters that are likely to appear in more common words. It would also be useful to keep track of the letters that have been guessed correctly and use that information to eliminate possible words from the dictionary, further reducing the pool of possible words and improving the accuracy of letter frequency calculations. Finally, incorporating word length into the algorithm could also be beneficial. For example, if the masked word is very short, it might make sense to prioritize letters that appear more frequently in short words. Reach out if you're interested...
₹10,000 INR in 7 days
0.0 (0 reviews)
0.0
0.0
User Avatar
HhI I am experienced in and I can start right now but i have few doubts and questions lets have a quick chat and get it started waiting for your replyyy
₹1,050 INR in 7 days
0.0 (0 reviews)
0.0
0.0

About the client

Flag of INDIA
Gurgaon, India
0.0
0
Member since Jan 20, 2023

Client Verification

Thanks! We’ve emailed you a link to claim your free credit.
Something went wrong while sending your email. Please try again.
Registered Users Total Jobs Posted
Freelancer ® is a registered Trademark of Freelancer Technology Pty Limited (ACN 142 189 759)
Copyright © 2024 Freelancer Technology Pty Limited (ACN 142 189 759)
Loading preview
Permission granted for Geolocation.
Your login session has expired and you have been logged out. Please log in again.