Hi there, I’m actually trying out to see if I can just use Go as a replacement for the Ruby code, which I can find it challenging, the fact that the types are not declared, and I have to piece that in myself, but I do find myself confused at the Btree portion of chapter 2 (yes, I’m just slowly reading).
In the code of
binary_tree.rb there is this line:
neighbors « cell.north if cell.north —
This does cause my maze to look bad. I have to use south as the neighbor to get a correct looking maze, as done in my btree implementation
In my mind, it would make sense, as I thought of 0,0 to be the top, left corner of the grid.
I have not run the ruby code yet, and I’m just wondering why the code in the book is done the way it is.