Me and a team of programmers are programming a robot to play a game in a competition. We did not create the hardware, and all teams will use the same type of robot.
The game has two players opposing each other and are both trying to achieve an objective. This objective is to move to a position to pick up a payload then return to another position to return the payload. Each team has their own payload and their own target to bring them to, and it is impossible to pick up the other team's payload. The team that brings their payload to the target first wins and the game is ended. There is a time limit of 210 seconds, and if the games times out, the team who held the payload the longest wins.
However, it is a little more complicated than that. The robots also have the ability to face the opponent and "push them back" from any range (the closer they are the more forcefully they push). Also, if a robot is pushed out of the bounds of the playing field, they drop their payload and it is moved back inside the playing field.
GAME THEORY QUESTIONS
First of all, is this a zero-sum game or not? I am new to game theory math and I am not completely sure if it is.
Also, how does the minimax theorem apply to this specific game? I understand how it works, but I do not know what the values to account for would be in this game (would it be the difference in how long each team has held the payload somehow combined with how close they are to bringing to the target?)
I really am not sure at all how to calculate any of this, but if anyone can at least point me in the right direction for coming up with an effective strategy system for this I would be very appreciative.
Thank you so much for your time, this project is very important to me and your help means a lot. If I need to clarify anything please ask, I am not sure if I included all the information needed for this problem.