Break Rings / All to All

I would like to give some feedback about ...

From: http://www.checkio.org/mission/break-rings/solve/

HTTP_USER_AGENT:

Mozilla/5.0 (Windows NT 10.0; WOW64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/46.0.2490.86 Safari/537.36

Hello, I've written what I believe to be a functional solution for the Break Rings mission, but it fails the "All for All" assertion. The data passed to the function describes FOUR rings, all connected to one another. The assertion is that the return value should be 3. I believe that this is incorrect. If all FOUR rings are connected to one another, breaking ONE of them still leaves the other THREE connected. The only way that I can think that 3 would be the right answer is if one were to assume that there were SIX rings, and that rings 5 and 6 weren't in the data supplied to the function, because they were not connected to any other rings. However, employing this methodology would allow for sets of rings no longer than 6, which is disproved by the next assertion on the list, which has 9.