- Joined
- Sep 9, 2015
- Messages
- 665
- Reaction score
- 877
- First Language
- English
- Primarily Uses
- N/A
def find_route_to(room,current,home,count,lst)
#first create the depth search paramaters
count += 1
#intialize the results each depth
ram = 0
#check each connection per depth searched
current.connected.each_with_index do |i, cnt|
look_depth = i.name.upcase
indexer = i
if i.name.upcase == room.upcase
#puts visited_node
puts "#{true} #{cnt}, #{count}"
ram = [cnt, count, current.name]
return ram
end
end unless nil
return false if count > home.size
find_route_to(room,home[count],home,count,lst) if count < home.size
end
wayfayer/wayfinder algorithm, aka A* not. but a nodal based algorithm for perusing a corridor, living room, etc.
Apache License 2.0 as in it may be used as written, in a way I can address in a bit. sorry, it's engineless. it was a science experiment in pure Ruby.
and lastly, something I've known through a brother, my naturally memorized life, save a few in memory as dream/vision.

thus, my understanding to a word, known as augenwerkerbekreitensieg (to love what is seen as made in victory, as in to succeed in making of thing beloved).
Last edited: