Solve this probability problem - 15/01/2023 10:20 EST

État: Closed
Prix: €50
Propositions reçues: 47
Gagnant: Divyansh4321

Winner

Résumé du concours

We are struggling with a little problem.
We want to know how to avoid "multiple winning cards" in a card board game.
I explain :
We have 10 players with 1 card each.
Each card is unique in the whole game.
At the end only 1 card must win.
The game :
Each player gets 1 unique card. These cards are very funny to see, so that makes the game very funny.
A question is asked : Which card makes you feel happy ?
Each player must choose 3 cards of 3 different players to answer this question.
By doing this we noticed at the end that we had many winning cards.
But our goal in this board game is to get 1 and only one winning card.
So can you think of a solution so that at the end we get only one winning card ?
Please send us your proposition sealed so that nobody copies your solution.
The solution that we will choose will be the winner of this project.
If we are very happy with your idea you will get an extra bonus of 100 euros ! above the project price !
Good luck !

Compétences recommandées

Winner

Publiez un concours comme celui-ci

Commentaire de l'employeur

“Divyan is a great brainstormer, even we had many entries looking like each other. Divyan communicated it in a nice structured way. We will work with this freelancer again for sure ”

yasminevw2016, Netherlands.

Tableau de clarification publique

nitinjoshi79
- il y a 3 semaines
Dear CH, a gentle reminder that only one day remains to award this contest. Hope you got some useful ideas.

Sincerely
#47
- il y a 3 semaines
HandokoD
- il y a 1 mois
Hello, My Entry is #39 . It is 14 pages (14 jpg file) not only 1 page. I couldn't send the pdf file so I splitted it into 14 pages and changed the file format to jpg. Hopefully the probability theory solution that I propose is the best for you.
- il y a 1 mois
nitinjoshi79
- il y a 1 mois
Please take a moment to review #47 .
- il y a 1 mois
KhurramAliShah
- il y a 1 mois
#32
- il y a 1 mois
lukmanm37
- il y a 2 mois
hello. Kindly check entry #11
- il y a 2 mois
KhurramAliShah
- il y a 2 mois
please check #7
- il y a 2 mois
KhurramAliShah
- il y a 2 mois
#7
- il y a 2 mois
akiaglobal
- il y a 2 mois
can you explain how the game proceeds further and ends with many winners?
- il y a 2 mois
UroojAarif
- il y a 2 mois
#15 please check my best solution
- il y a 2 mois
UroojAarif
- il y a 2 mois
please check my best solution
- il y a 2 mois
iamwajid
- il y a 2 mois
after choosing 3 different cards from 3 different players, dose the cards get raveled to all players or stay hidden then dose players need to guess the which card will make him happy(card which will provide answer) out of those 3 cards. can you explain it with one examples like one played game.
- il y a 2 mois
KhurramAliShah
- il y a 2 mois
please rate #7
- il y a 2 mois
simulinkcoder
- il y a 2 mois
One solution to this problem would be to implement a voting system where players can vote for the card they believe should win, rather than each player choosing 3 cards themselves. This way, the card with the most votes would be the winner. Another solution could be to randomly select a winner among the cards that received the most votes. Another option is to assign points to the cards chosen by each player, and the card with the most points at the end would win.
You can also use a combination of these solutions to increase fairness and make sure that the game is fun.
- il y a 2 mois
MohammadSalem1
- il y a 2 mois
The solution is simple, but I am new to Freelancer, and I could not participate in the competition, and I do not know the reason
How can I communicate with you
- il y a 2 mois
1. MohammadSalem1
  - il y a 2 mois
  This depends on giving an order of the three sounds
  That is, the first card can be considered with 9 points, the second with 7, and the third with 5, and you will be able to collect points, and accordingly, the winner will be determined
  This will make the possibility of a tie very slim
  I suggest this solution
  - il y a 2 mois