Arrow mazes, also known as vector mazes or directional mazes, consist of cells that are connected by arrows. You can move to adjacent cells if the cell you are in has an arrow pointing to them. For example, if the cell you are in has an arrow pointing to the right, you can move one cell over to the right. Diagonal moves are also permitted if the appropriate diagonal arrow is present. If you go one way, you cannot necessairily go back, so it is possible to get stuck.
Arrow mazes are a form of local directed graph. Directed graphs are important in math, computer science, and other fields.
The clever maze solver may note that you can solve arrow mazes backwards by starting at the finish and working backwards by asking “what cell points at the one I am in?”, and then moving to that cell. This arrow maze has mechanisms in place to reduce the effectiveness of “back-solving”. Specifically, there are paths through the maze that start spontaneously, go to the finish, and are completely disconnected from the start. Also, the existence of loops can make back-solving a little bit trickier.