bruh

Thank you, I thought that distance should be calculated as cell-by-cell path, and sorry for wrong mark:)

Hey, it's me again:) Sorry for disturbing, but i have one more suspision about reference algorithm correctness. Here is the deal:

requestedDirectionsTo: 'S'

Village map:

  [ ' ', ' ', ' ', ' ', ' ' ],
  [ ' ', ' ', ' ', ' ', ' ' ],
  [ ' ', ' ', ' ', ' ', ' ' ],
  [ ' ', ' ', ' ', ' ', ' ' ],
  [ ' ', ' ', ' ', ' ', ' ' ],
  [ ' ', 'S', ' ', ' ', ' ' ],
  [ 'S', ' ', ' ', ' ', 'S' ],
  [ ' ', ' ', ' ', ' ', 'S' ]

Reference solution:

  [ '↘', '↓', '↙', '↙', '↙' ],
  [ '↘', '↓', '↙', '↙', '↙' ],
  [ '↘', '↓', '↙', '↙', '↓' ],
  [ '↘', '↓', '↙', '↙', '↓' ],
  [ '↘', '↓', '↙', '↙', '↓' ],
  [ '→', 'S', '←', '↘', '↓' ],
  [ 'S', '↑', '↖', '→', 'S' ],
  [ '↑', '↖', '→', '→', 'S' ]

My solution:

  [ '↘', '↓', '↙', '↙', '↓' ],
  [ '↘', '↓', '↙', '↙', '↓' ],
  [ '↘', '↓', '↙', '↙', '↓' ],
  [ '↘', '↓', '↙', '↙', '↓' ],
  [ '↘', '↓', '↙', '↙', '↓' ],
  [ '→', 'S', '←', '↘', '↓' ],
  [ 'S', '↑', '↖', '→', 'S' ],
  [ '↑', '↖', '→', '→', 'S' ]

Distances map:

  [ '5.4', '5.0', '5.4', '5.8', '6.0' ],
  [ '4.4', '4.0', '4.4', '4.8', '5.0' ],
  [ '3.4', '3.0', '3.4', '3.8', '4.0' ],
  [ '2.4', '2.0', '2.4', '2.8', '3.0' ],
  [ '1.4', '1.0', '1.4', '2.4', '2.0' ],
  [ '1.0', '0.0', '1.0', '1.4', '1.0' ],
  [ '0.0', '1.0', '1.4', '1.0', '0.0' ],
  [ '1.0', '1.4', '2.0', '1.0', '0.0' ]

Difference between solutions in [0,4] and [1,4]. Let's take [0,4] for example, in ref solution it points to keyPlace [5,1] with distance 6.2, in my solution it points to keyPlace [6,4] with distance 6.0, why so? Thank you for your help:)

Oh, now I'm understanding this, thank you)

It seems that current solve implementation is not assigned with task conditions.

"In case of a tie, prefer the location with lowest row index.
If there still is a tie, prefer the location with lowest column index."

Here is an example that generated as random test for me:

Village map:

[ ' ', 'T', ' ', ' ', ' ' ],
[ '#', ' ', ' ', '#', 'T' ],
[ '#', ' ', ' ', ' ', ' ' ],
[ ' ', 'T', ' ', ' ', ' ' ]

requestedDirectionsTo: #

Reference solution:

[ '↓', '↙', '↘', '↓', '↙' ],
[ '#', '←', '→', '#', '←' ],
[ '#', '←', '↗', '↑', '↖' ],
[ '↑', '↖', '↗', '↑', '↖' ]

My solution:

[ '↓', '↙', '↘', '↓', '↙' ],
[ '#', '←', '→', '#', '←' ],
[ '#', '←', '↗', '↑', '↖' ],
[ '↑', '↖', '↖', '↑', '↖' ]

Distances map:

[ '1.0', '1.4', '1.4', '1.0', '1.4' ],
[ '0.0', '1.0', '1.0', '0.0', '1.0' ],
[ '0.0', '1.0', '1.4', '1.0', '1.4' ],
[ '1.0', '1.4', '2.4', '2.0', '2.4' ]

Look at the cell [3, 2], it has 2 cells around with distances 1.0 ([2, 1] and [2, 3]), but reference solution prefer cell with higher column index.

Hello. The function returns a single location, but a bug report reports that 2 positions have been received. console.log() shows return value. Is it possible that task verification has a problem?
http://joxi.ru/12M8zyBH00qMdm