• The first argument should be a list/array of tuples/arrays
• The output should be a string
• All the fixed tests should be present in the example tests
• The description needs an entire rewrite, fixing the wording and giving proper/appropriate information.
  • I got awfully side tracked with the amazon warehouse context, where I first thought the robot was one of those automatic machine that are nowadays picking boxes in the warehouse for humans. Except, the robot is actually an item inside the box we are looking for. Alos, since there are ways to walk between each staks in "mamzon's warehouses" or such, I couldn't make any sense of the accessibility info. In fact, HERE all the boxes are piled up in a compact way, without "room" in between coordinates. Solving the kata just after I woke up didn't help, but nothing in the description could get the idea out of my mind => the context is still awfully chosen and described.
  • It's not "the box" or "the robot" the user wants to find, but the "box containing the broken robot"
  • Axis directions must be made cristal clear in the description: the user shouldn't have to deduce the fact from the example (moreover, if it get changed, the info could disappear by mistake. Currently, there is one single tile in the whole example that disambiguates the directions).
  • Currently, the task is NOT about accessibility, but about VISIBILITY. Like, from n->s: 1,0,1,0,1,0,1,2,0,1,2,1,2,2,X (with X at height 3), X is visible from n and s, but NOT accessible from s because too heigh. Or if height does not matter, nobody reasonnable would EVER access the robot from norht when it's accessible from south in zero step.
  • the "drawing" at the end of the description is absolutely useless in its current shape:
    1. it's drawing the view from a wrong point of view
    2. the X has to be visible in the example
    3. another situation must be used so that the impact of the height of X is made clear (something with X at h=2)

Compilations tests should be added for cases like calc.One.One.One or calc.One.Plus.Plus.Times

Input is of format x;y instead of y;x, so 0;0 0;0 0;1 1;1 gives

2|0
1|1

instead of

2|0
1|1

.

Not an issue ;-)

FixedTests("0;0 0;0 0;1 1;1",0)
Test Failed
Expected and actual are both <System.Char[3]>
Values differ at index [2]
Expected: 'e'
But was: 's'

Why it should be "east"? If array contains element at position 0;1 that means 0;0 will be not visible from "east".What am i doing wrong or what i don't understand?

Yes: https://github.com/codewars/codewars.com/wiki/Troubleshooting-your-solution#how-can-i-see-which-input-causes-my-solution-to-fail

random test always shows failed...

Is it possible to display, in addition to the error, the input array to understand what the problem is.

TestCase("0;0 1;1 0;1 1;0 4;0 0;0", 100, ExpectedResult=new char[0])

Nothing is told about such cases in the description.

There shouldn't be any box blocking line of sight. So let's say the box you'd like to see is on level 1 and it's in the third row, if you look from the north then we cannot have any boxes on rows one and two.
In the same scenario if special box is on level 2 then you can have boxes in row one and two up to level 1, but if you have another box on level 2 or higher, then you wouldn't see special box.

Could anybody help me to understand the question better?
Is the question finding a direction to see the target, meaning that there isn't any block that isn't any other box align before on that direction before the box we want to find?

I am unable to pass the test case with this preset, while I have checked the test case manually that my code works as expected.

Approved as an easy 5 kyu.
Average rank was messed up by an 8 kyu. :D

Hey! Congratulations on making your first kata.

I made some minor improvements:

• Consolidated the tests into fixed and random tests.
• Consistent tabs/spaces in various places.
• Consistent placement of curly braces in various places.
• Fixed a couple of typos on variable names.
• Added the box on the left to the example at the end of the description.