1. Foosball agent Dov Maizlish & Yuval Zentler supervised by Victor Yosef

2. Background and eco-system Part of a multiple-project effort to create a self learning, foosball playing robot Our project ’ s goal was to create a non- learning, algorithmic reference.

3. The playing field All work was done on a server written as part of a previous project by Schmidt Michael & Shamis Eugene

4. Major hurdles: The rate of incoming packets was too low to allow any sophisticated maneuvers. Commands to the server were executed in a hard to predict manner. The Only information available was ball location and speed. The Lack of a clear benchmark that would allow evaluating quality of agent.

5. Break down of the players Since every row has different environment characteristics (function, number of players, distance from adversarial units) a slightly different heuristic had to be applied to each of them.

6. Break down of the players – con ’ t Goalie : – most effective unit. Has the simplest job : needs only to intercept the ball. Does not try turn.Does not try turn Defender : too close to the opposing attack to effectively block the shots. Main job is thus to help the goalie pass intercepted balls forward

7. Break down of the players – con ’ t Midfielders : large number of players playing very close to opposition. Very hard to react, do not turn. Offence : a certain amount of randomness has been incorporated into the agent in order to avoid cases of repetition of moves ad- infinitum.

8. Bringing it all together Since the player is mandated with having only two hands an arbitration mechanism was needed to select the current active rows. The solution was using a round-robin like scheme were every row can appear more than once. Thus enabling priority distribution according to ball location, speed and row affectivity.

9. Real world rearing it ’ s ugly head Friction had to be taken into consideration when performing calculations. – The friction value was ascertained by observing ball velocity degradation over a linear course.

10. Weak points /future enhancements Attempts to execute team play / passes have not proven themselves successful due to low granularity of input data. Due to feature/bug/errata of the server a number of forward turns may or may not manifest themselves as backward kicks.

11. Groups Normal – arbitrates all 4 rows. Attack – uses only goal keeper and attack row. Defence – uses only goal keeper and defence row. When ball is idle, nearest row moves anyway.

12. Results Each group against another. 2 games with different friction value. 15 minutes each. Normal vs. Attack: 61:9, 24:5 ( fric = 0.03, 0.15) Normal vs. Defense: 23:0, 17:1 Attack vs. Defense: 2:15, 4:8

13. Conclusions: Normal group played best. Defense group hardly got chance to score. The idle defenders of the attack group mislead their goal keeper, resulting in own goals. Slower games with increased friction value.

14. Backup

15. return

16. Software Stracture Han d 1 Hand 2 Arbit rator GK_De cision() DefDec ision() MidDec ision() AtkDec ision() Theta Calc() TwoPi _Modu lo() TimeCa lc() IntCalc( ) Frictio nCalc( ) Team type Prevous choice