Robocode player + team strategy. Quarter finals in our class Robocode Competition. Mark: 7.9
For each enemy robot we update the distance by the largest scan by each robot on our team using messages that we handle in onMessageRecieved(). Once all possible robots have been scanned, we go through the HashMap and look for the smallest possible distance for each key. In this way we obtain the robot with the shortest distance towards our team.
![robocodeTorneigClass](https://private-user-images.githubusercontent.com/92806890/297491762-1ae16acd-4b79-447a-8213-3f47116211e7.jpg?jwt=eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJnaXRodWIuY29tIiwiYXVkIjoicmF3LmdpdGh1YnVzZXJjb250ZW50LmNvbSIsImtleSI6ImtleTUiLCJleHAiOjE3MjQzNDk0MTcsIm5iZiI6MTcyNDM0OTExNywicGF0aCI6Ii85MjgwNjg5MC8yOTc0OTE3NjItMWFlMTZhY2QtNGI3OS00NDdhLTgyMTMtM2Y0NzExNjIxMWU3LmpwZz9YLUFtei1BbGdvcml0aG09QVdTNC1ITUFDLVNIQTI1NiZYLUFtei1DcmVkZW50aWFsPUFLSUFWQ09EWUxTQTUzUFFLNFpBJTJGMjAyNDA4MjIlMkZ1cy1lYXN0LTElMkZzMyUyRmF3czRfcmVxdWVzdCZYLUFtei1EYXRlPTIwMjQwODIyVDE3NTE1N1omWC1BbXotRXhwaXJlcz0zMDAmWC1BbXotU2lnbmF0dXJlPTViNDJhYTQ1NjFkMzFkNmY0ZjI0MzAzNTNmZDE2MzVmNDFhMTllODEzOTdkZjcwNTQzMzkwOTRmMjgzZjkyNjImWC1BbXotU2lnbmVkSGVhZGVycz1ob3N0JmFjdG9yX2lkPTAma2V5X2lkPTAmcmVwb19pZD0wIn0.Yvp4bUtEmi6aSn2zcYHDoZ1p1yosA6YxFoFL8ZgeN5I)
@artHub-j Arturo Aragón |
@FerranEJ Ferran Escala |