Sashigane + Building-Walk Hybrid:
The grid consists of 8 floors which are arranged on top of each other, creating a 3d space.
Divide the grid into regions of orthogonally connected cells. Each region must be an L-shape with a width of one cell. These regions can extend through various floors, as long as they remain L-shaped.
Arrows must be located on the ends of an L shape, and point towards the bend.
Arrows that are tilted by 45° point either to the floors above or below depending on their orientation.
A circle must be located at the bend of an L shape and contain a number indicating the amount of cells contained in the L shape. All numbers have to be deduced by the solver.
Cells divided by a red border must be in different L shapes. Cells that have no border between them must be within the same region.
Additionally draw a path from S to G that doesn't branch off or overlap itself at any cell; not even while changing floors. The path must visit every elevator/arrow.
The path can only change floors using an arrow. If the arrow is pointing upwards (or upwards with a 45° angle) the path must change to a higher floor.
The path must change floors at an elevator with a horizontal arrow, but this can be in either direction.
When switching floors at an arrow, the destination must not contain another arrow.
Digits in circles show in which floor the corresponding cell must be visited by the path. The corresponding cell will only be visited at that floor. E.g. if 1st floor's r1c2 has a value of two, the path must visit r1c2 in the 2nd floor and must not visit that cell in any other floor.
The path may not cross red borders.