A friend of yours has given you directions to the best restaurant in town. It's a series of left and right turns. Unfortunately, they forgot to mention for how long you need to go straight ahead between those turns. Luckily you have a street map with all the restaurants on it. Maybe you can figure out which restaurant they meant?

## Input

The map is given as a rectangular grid of ASCII characters. . is a road, # is a building, A to Z are the various restaurants. You start in the top left corner, going east. Example:

.....A
.#.###
B....C
##.#.#
D....E
##F###


Your friend's instructions will be given as a (potentially empty) string or list of characters containing Ls and Rs.

## Output

You can walk any path that corresponds to the left and right turns in the input string, provided that you take at least one step forward before each of them, as well as at the end. In particular this means if the string starts with R you cannot go south immediately in the left-most column. It also means you can't turn around 180° on the spot.

You cannot walk through buildings or restaurants except the one you reach at the end. You may assume that the top left corner is a ..

You should output all the restaurants that can be reached with your friend's instructions, as a string or list.

You may assume that the instructions will lead to at least one restaurant. E.g. a single L would be invalid for the above map.

Some examples for the above map:

<empty> A
R       F
RR      B,D
RL      C,E
RLRL    E
RLLR    C
RLLL    B
RLRR    D
RLRRRR  A,C
RLLLRLL B


Note in particular that R doesn't reach B.

You may write a program or function, taking input via STDIN (or closest alternative), command-line argument or function argument and outputting the result via STDOUT (or closest alternative), function return value or function (out) parameter.

Standard rules apply.

Here is a larger map, courtesy of Conor O'Brien (which I modified a bit):

.......Y..........................######
.####.....#.##....##..######....#.###.##
B.........#.##.#..##....##...##.#.#P...#
.#.#####..#.##..#.##....##.#....#.####.#
.#.#...C..#.##...G##..#.##.#....#.#....#
.#.#.#.#..#.####.###.#..##.#....#.#.NO.#
.#.#A#.#..#.##...F###...##.#.##.#......#
.#.###....#.##....##....##.#....###....#
.#.....##...##....##...D##........###R.#
.#.##..##...##E...##..######....####...#
.....X....#.#.....................##S.T#
###########.###########M############...#
#................................###.#.#
#.#########.########.######.#.######.#.#
#......V#.....######.IJ...........##.#.#
#########.###......ZH############L##.#.#
#########.##########.###############.#.#
####K##...##########.#....#..........#.#
####....########U......##...#######Q.#.#
#####################################W.#


And here are a few selected lists of directions and their expected results:

<empty>                                 Y
RR                                      B
RLL                                     Y
RLRR                                    B,C,X
RLLLRRR                                 G
RLRLRLRL                                I,Z
RLLRRRLRRLRR                            C,D,F,G,Y
RLRRLLRLLLRL                            B,C,Y
RLLRRLRRRLLLL                           F,M,N,O,Y
RLRRLLLRRRRLLLL                         F,M,Y
RLRRLRRRRRRRRRR                         E,F,Y
RLRRRLLLRLLRRLL                         M,N,O
RLLRRLRRLRLRLRRLLR                      E,U
RLRLLRLRRLRRRRRLRL                      F,G,I,Z
RLLRRLLRLLRRRLRRLLRR                    W
RLLLRRRLRRLLLLLRLLLLLL                  D,G,X
RLRLLRLRRLRLRRRLRLLLRR                  B,C,E,J,X
RLRLRLLLLRLRRRRRRLRLRRLR                Y
RLRLRRRLRLLLLRLRRLLLLRLLRRL             E,M,X
RLRLLLRRRLLLRLLRLLRLRRLRLRR             B,E,F,K
RLRRRLLLLLLLLLLLLLLLRRRRLLL             A,B


Bonus question: is there an input that results in only I or only U? If so, what's the shortest such path?

# Perl, 150149146145141140138136135133130126125 124

An initial attempt.

Run with the map on STDIN and the directions after the -i option, e.g.

perl -F -Xn0iRL incomplete.pl
.....A
.#.###
B....C
##.#.#
D....E
##F###


Close STDIN with ^D or ^Z or whatever works on your operating system.

incomplete.pl:

%P=0;$^I=~s{%;=!/ /;%P=map{$_|=$F[$^H=$_+=(1,@+,-1,"-@+")[$d&3]]=~/(\w)|#|^$/*~!\$;{$1}}(%P)x@F}$d-=B&$'^ueg;print%  Replace the ^H by the literal control character to get the given score Bonus question: • There is no input that results in only I • The shortest input that results in only U is RLLRRLLRLRLRRLRRLRLRLRRLLR • The longest input needed to result in a unique set is RLLRRRLRLRLLLRRLRLLLLLRRRLLRRRLLLLLLLRRLRRRR which gives B O R • The Ton Hospel? :) – Lynn Feb 24, 2016 at 21:03 • There is only one alien with that name Feb 24, 2016 at 21:15 • @TonHospel It's a honor to have you here. Feb 24, 2016 at 21:30 # Python 2, 180177168163161 158 bytes def a(v,o,c=0,A=0,d='.',O={0}): while'.'==d:w=v.find('\n');c+=[1,~w,-1,w+1][A%4];d=v[c];o>v<a(v+' '*w,o[1:],c,ord(o[0])-~A,d);d>v>o<O.add(d) returnO[9::5]  Parameter v is the map as a string; o is the LR string. Mitch Schwartz saved 2 3 10 lots of bytes. Thanks! I saved two bytes by setting O={0} and returning O[9::5], which might not be very portable: it assumes that hash(0) == 0, I think, because that causes the order of elements in repr(O) to be set([0, 'A', 'B', 'C'])  and creatively slicing that string gets me the answer. • I think this suffers from an exponential explosion if you run it on a big almost empty grid with longish turn strings Feb 25, 2016 at 0:57 • Oh, yes, it's an absolute performance disaster. It works for the example grids, though! – Lynn Feb 25, 2016 at 1:04 # C++ 369 Thanks to @ceilingcat for finding a much better (and shorter) version #import<bits/stdc++.h> #define M m[y][x] using namespace std;vector<string>m;char n[99],j;int r(int x,int y,char*d,int z){for(;z%2?y+=z-2:(x-=z-1),y>=0&y<m.size()&x>=0&x<m[y].size()&&!*d|M==46&&(!*d?n[M]+=M>64&M<91,M==46:!r(x,y,d+1,z+(*d-82?*d==76:3)&3)););}main(int c,char**v){for(string l;getline(cin,l);)m.push_back(l);for(r(0,0,v[1],0);j<99;j++)n[j]&&cout<<j<<" ";}  Try it online! • A clarity improvement (no change) along with incorporating a C++ tip: 384 Feb 9, 2020 at 21:24 • @ceilingcat I have no idea why I wrote that since there is always an argument... Dec 29, 2021 at 2:02 # Haskell, 257 bytes import Data.List t=transpose r=reverse l=length f(m,x,y)=[(m,n,y)|n<-[x+1..l(m!!0)-1],notElem '#'[m!!y!!z|z<-[x..n]]] i!c=[last$(t.r$m,l m-y-1,x):[(r.t$m,y,l(m!!0)-x-1)|c/='L']|(m,x,y)<-i>>=f]
m#i=intersect['A'..'Z'][a!!y!!x|(a,x,y)<-foldl(!)[(m,0,0)]i>>=f]


Try it Online!

Calling m#i for a map m with a list of instructions i outputs the possible restaurants.

# Python3, 333 bytes:

m,n={1:{0:3,1:4},2:{0:4,1:3},3:{0:2,1:1},4:{0:1,1:2}},{1:(0,1),2:(0,-1),3:(1,0),4:(-1,0)}
def f(b,p,x,y,d):
try:
if b[x][y]=='.':
x+=n[d][0];y+=n[d][1]
if 64<ord(r:=b[x][y])<91 and not p:yield r
if x>=0and y>=0:yield from f(b,p,x,y,d);yield from f(b,p[1:],x,y,m[d][p[0]=='L'])
except:1
q=lambda b,p:set(f(b,p,0,0,1))
`

Try it online!