Talk:Ricochet Robots

Computer solving

I strongly doubt that this is really a NP-complete problem (even considering a general n by n board which I assume is implicitly meant). The reason for this is simply that given that there is only 4 or 5 robots the number of different positions they can be configured in is of order (n^2)^4 for 4 robots, which is polynomial. So given that one may use dynamic programming and in that way do a backward search through all positions one would be able to solve all possible solutions in polynomial time and that would certainly include any specific solution. This solution would also only require polynomial memory so unless I am mistaken this problem is in P given that the number of robots are fixed. (PositivaPatrik (talk) 18:25, 9 March 2013 (UTC))

Ricochet Robot vs Ricochet Robots

Going by the listings on BoardGameGeek, only one version of the game (the first one?) was called "Ricochet Robot" (singular). The rest were called "Ricochet Robots" (plural), and this is how the game is known. Why does the Wikipedia article use the singular "Robot" name? salty-horse (talk) 14:10, 2 May 2017 (UTC)

@Sitago, XSG, and DavidWBrooks: Pinging more editors to gather input. TheDragonFire (talk) 14:23, 2 May 2017 (UTC)

Because 'Ricochet Robot' came first and is what the game was original known as. Does it really matter? If you change the name of the article to Ricochet Robots with a redirect from Ricochet Robot I don't think anyone will care. —  X  S  G  22:51, 2 July 2019 (UTC)