For example, the log for one of the Hard tests says: ABCDEFGHIJ.

That doesn't sound right. Can you say which language Kata you are using so I can see it happen?

~

FYI - the hard tests should be

    assertEquals("AGFEDCB", Dinglemouse.antBridge("GFEDCBA", "------....-.---"));
    assertEquals("EDCBA", Dinglemouse.antBridge("EDCBA", "--..---...-..-...----..-----"));
    assertEquals("GFEDCBAJIH", Dinglemouse.antBridge("JIHGFEDCBA", "--........------.-........-........---....-----"));
    assertEquals("CBAJIHGFED", Dinglemouse.antBridge("JIHGFEDCBA", "-.....------........-.......-.......----"));
    assertEquals("GFEDCBAJIH", Dinglemouse.antBridge("JIHGFEDCBA", "-------.......-.......-"));
    assertEquals("EDCBAJIHGF", Dinglemouse.antBridge("JIHGFEDCBA", "-------.......-.......-.......-"));

But, using some console.log or printf or System.out.println (or some equivalent function for thelanguage) you can log the input (ants, terrain) values yourself.

Apologies, didn't mean to mark it as an issue. To clarify, I just meant that the log for the tests labeled "Hard" don't provide much detail. For example, the log for one of the Hard tests says: ABCDEFGHIJ. However, the log for a case in the Random tests says:

Random test #1: ants = LKJIHGFEDCBA, terrain = -----..........-----....----......-.....----.........-
Expected = GFEDCBALKJIH

Without the values for ants and the terrain, it's hard for me to debug my code.

I'm not sure why this is flagged as an ISSUE. AFAIK there are no problems with the hard tests. Anyway, if you suspect Kata problems, please say the language so someone can confirm your report. But if there are already multiple solutions for your languange then any issue is more likely to be in your solution.

As for guidance, I am not sure -- the tests are called "hard" for a reason, so you may have to go to pencil and paper to see where you went wrong. IMO, it is suspicious that FEDCBAJIHG and GFEDCBAJIH are almost the same except for the G at the wrong end, so it might just be a case that you need to iterate your logic one extra step?

Hi, some of the test cases under hard only provides what I'm assuming is the original order of ants and nothing else, so I'm not able to debug my code. MY code is currently passing 109 and only failing 4 tests (all of which are in the Hard tests. For example, the log says: ABCDEFGHIJ.
The feedback is:
'FEDCBAJIHG' should equal 'GFEDCBAJIH'.

Can I please get some guidance? Would really like to figure this one out!

true Chadley behavior