First kata I've done where I felt like I was able to achieve a perfect balance between simplicity and the approach. Really enjoyed this one.

Dinglemouse, really enjoyed this one, but seemed a little too easy for 3kyu. Found a pretty straightforward solution in about an hour where I've spent a week on some of your others.

Awesome kata. Thought this would be easier than "Blaine is a pain" because they seem similar, but it was tricky in a different way. At first I was convinced the "ambiguity" rules made no sense...then I saw it! Makes perfect sense.

It was staring me right in the face lol. So embarrassed.

(C#)

What am I missing about initial train positions?

The test for this track is expecting a crash at move 0:

aTrain: Eeeeeeeeeeeeeeeeeeeeeeeeeeeeeee, position: 7
bTrain: Xxxx, position: 0
/----\     /----\ 
|     \   /     | 
|      \ /      | 
|       S       | 
|      / \      | 
|     /   \     | 
\----/     \----/

Based on the instructions, it seems like the initial position should be:

Xxxx-\     eeeeee
|     \   e     e
|      E e      e
|       e       e
|      e e      e
|     e   e     e
\eeeee     eeeeee

...

Mine is a little toothy compared to the solutions using DataTable, but seems to be 2x as fast.

My bad. Thanks for the clarification.

I don't think the C# tests are working. Partial output...

0:705

1:155

1:798

2:304

2:736

2:800

Expected and actual are both <System.Collections.Generic.List`1[System.Int32]> with 99 elements
Values differ at index [3]
Expected: 736
But was: 304

I thought my solution was pretty good,but this is just bad ass.

I am having the exact same issue.

The unit tests for this kata are riduclous and they ruin what would otherwise be a great kata. The "performance tests" time out and I'm sure there is some amazing one liner solution to this problem but I don't have the time or patience sorry. I have made several general solutions that solve this problem fairly quickly but I can't submit due to the time out. Will be moving on with my life.

I've come up with 3 fast ways to solve this (or so I thought)...but none of them is fast enough to pass the performance test. I keep getting a timeout on those tests. My current method solves each of the 3 test cases in about .4ms to .5ms. I also did the 1011 example from JohanWiltink's comment and that is clocking in at about 1.2 to 1.4ms. How slow am I here? What kind of performance should I be getting?

Wow, I really over-thought this one...live and learn I guess