A torus maze™™™™™

Solution done by the bfs algorithm. And here is the video how does bfs fill the maze and traces back.

Here's a graph showing the connections:

where start is at node "0", end at node "1".

The most straightforward solution is then:

Here's the solution on maze

where the red squares in the maze are the blockades/misdirects.

Here's the torus maze solution on a torus.

where the red and green squares are the start and endpoints.

My path:

Or,

Explanation:

Here I have highlighted the important walls in purple, splitting the maze into sections. Every area within a section can be reached from every other, and (obviously, since I highlighted walls) there are no ways to go from one section to another.

Here I've cleaned up the maze, leaving just the important borders. (Yes, I manually drew all of those walls in Google Sheets. Where did my life go?). This maze looks much easier!

Now we're talking! I've straightened out the borders so now there are lots of neat rectangles. (Yes, I also did this manually).

Reasoning through the cleaned-up maze: