# .font: font.text_2
2020-09-16 18:19 dustin  
# .font: font.text_1
that's the result of another bd paperwork session about how to create and "detect" firefly distances. hopefully everything works (only) as intended, but i think i tested everything often enough :D

# .font: font.text_2
2020-09-18 20:45 Arno  
# .font: font.text_1
great idea! :D

# .font: font.text_2
2020-09-18 21:02 dustin  
# .font: font.text_1
thanks  Arno ! i'm looking forward to comparing our runs, i'm sure there are several possibilities :d

# .font: font.text_2
2020-09-18 21:50 Arno  
# .font: font.text_1
my run is certainly not time-optimized.  
  
let's see first who else will enter the arena! :-D

# .font: font.text_2
2020-09-18 23:25 dustin  
# .font: font.text_1
mine isn't, either. several times, i deflected the fireflies first so they didn't chase me closely anymore and i had time to do what i wanted to do ;)

# .font: font.text_2
2020-09-21 11:56 dustin  
# .font: font.text_1
i'd like to unlock my demo soon, if nobody else wants to try ( nesdori ? :D)

# .font: font.text_2
2020-09-21 12:34 nesdori  
# .font: font.text_1
 dustin , i'll try this today. i have some ideas how to do the first rooms with minimal "deflecting" :)

# .font: font.text_2
2020-09-21 13:42 nesdori  
# .font: font.text_1
ok, done! 0-2 are quite obvious and for 3-5 i basically used the same method for each one, of course a little modified for each room :)

# .font: font.text_2
2020-09-21 21:42 dustin  
# .font: font.text_1
 nesdori , this sounds as if we have very similar solutions :d

# .font: font.text_2
2020-09-21 22:05 nesdori  
# .font: font.text_1
 dustin , 0-2 probably are quite similar but i don't think the rest is.. :) but it's interesting to see what kind of approach you both chose. i had several non-hurry methods in my mind but i chose a method which nicely honors "cave scanning order" title :)

# .font: font.text_2
2020-09-22 10:53 dustin  
# .font: font.text_1
 nesdori  - sounds very interesting! i used methods very similar to those that you can watch between the rooms inside the "detectors" :d

# .font: font.text_2
2020-09-22 19:38 dustin  
# .font: font.text_1
my run free! curious to see yours! :d

# .font: font.text_2
2020-09-22 23:17 dustin  
# .font: font.text_1
great runs guys! your techniques inspire me to perhaps make a sequel with higher distances, if i find ways to "detect" those as well! :d

# .font: font.text_2
2020-09-23 00:30 nesdori  
# .font: font.text_1
 dustin , interesting idea :) creating any distance is easy with my method (given that there's enough dirt) but checker is trickier. i guess it's possible to formulate a general checker for all distances that accepts a certain distance but is it possible to do it in a way that it certainly rejects all other distances? :)

# .font: font.text_2
2020-09-23 10:47 dustin  
# .font: font.text_1
 nesdori , that's the decisive question! up to now, i just tried out some sensible-looking constructions, regarded them as functions where x=input distance and y=output distance and connected them to functions f_x: in_0 --&gt; in_0 where, for given x=0,1,...5, f_x(n)=0 if and only if n=x. for x&gt;6, the basic constructions i analysed so far don't change the input distance at all, so i'll definitely need new constructions. i think that above functions f_x should also exist for all natural numbers x because there are so many possibilities that it's just very likely to work :)