How to gather all possible solutions of a maze using backtracking algorithm?

Question

Given the following maze solver algorithm: link

How could I store all solutions matrices in a single 3D matrix (indexing each solution). For example:

solutio