Currently, there is no implementation of chopping the pot and only one player can be the winner. We need to determine that the best hand is tied per each pot (the main pot, and after that for the implementation of all in pots).
The solution of this is function that gets the remaining players -> uses the already built functions to determine the hands strength -> check for ties between the best hand and another hand until there is a hand that is not tied -> return the winners -> print the winners instead of one winner, and their hands -> chop the money equally between them (if can't be chopped equally, give to a random winner)
doper1
commented
2 months ago
Currently, there is no implementation of chopping the pot and only one player can be the winner. We need to determine that the best hand is tied per each pot (the main pot, and after that for the implementation of all in pots).
The solution of this is function that gets the remaining players -> uses the already built functions to determine the hands strength -> check for ties between the best hand and another hand until there is a hand that is not tied -> return the winners -> print the winners instead of one winner, and their hands -> chop the money equally between them (if can't be chopped equally, give to a random winner)