There ' s a natural gerrymander to the Senate though . It favors rural spots . Democrats break close enough to even on Senate results in spite of the fact that they get crushed on other statewide positions . <| sep |> Damn it looks so good and I love the paint color . Personally that slant would probably kill me <| sep |> Hey I am just keep sending you a trade request now . <| sep |> That scene from the wizard of oz where she goes through a tornado and ends up in another place <| sep |> Well not even reading the link and answering uninformed is kind of a dick move . This high level computer algorithm was invented in the 19 th century before computers existed . Trmaux ' s algorithm , invented by Charles Pierre Trmaux , is an efficient method to find the way out of a maze that requires drawing lines on the floor to mark a path , and is guaranteed to work for all mazes that have welldefined passages . A path is either unvisited , marked once or marked twice . Every time a direction is chosen it is marked by drawing a line on the floor from junction to junction . In the beginning a random direction is chosen if there is more than one . On arriving at a junction that has not been visited before no other marks , pick a random direction that is not marked and mark the path . When arriving at a marked junction and if your current path is marked only once then turn around and walk back and mark the path a second time . If this is not the case , pick the direction with the fewest marks and mark it , as always . When you finally reach the solution , paths marked exactly once will indicate a direct way back to the start . If there is no exit , this method will take you back to the start where all paths are marked twice . In this case each path is walked down exactly twice , once in each direction . The resulting walk is called a bidirectional doubletracing . Essentially , this algorithm , which was discovered in the 19 th century , has been used about a hundred years later as depthfirst search . wikipedia