I’m making a turn-based game with an arbitrary number of players. Turns happen simultaneously, players plan their move and then when all players submit, the plans are resolved. Think rock-paper-scissors, you decide what you’re going to throw then throw at the same time.
So, what I need for the first phase is for it to spawn a coroutine for each player to plan their move, and then submit it to a data structure the original method can see. I need the original method to wait until all the coroutines return.
What I really need help with is how to do that waiting, and how the coroutines will give their returns to the original method?