Advent-of-Code VS adventofcode

My DFS searches for a path by finding all the adjacent tiles and adding them to a stack. Then it moves to the tile on the stack and repeats this process either, till it finds the end or it runs out of new tiles on the stack. If it has found the end or a dead end, it reverts the steps up to a point, where another path is possible. That means, it gets in every little corner, before it finally finds the endpoint. The BFS might be so slow, because basically every new possible tile gets added to one big list that gets searched for every new possible tile. This naturally gets very big, berry fast, but is don't know any way to remove the tiles in this list that are not needed for comparisons anymore... Here is a Link to the code of the algorithms: Github

Here is my code: Github

here is a link to the original code on Github

I tried to model my code https://github.com/djotaku/adventofcode/blob/6c5d9c6e4f2dcbbbf7383b2923829c210faab028/2023/Day_04/Python/day_04.py (specifically lines 42-56) on my solution for Handy Haversacks in 2020 Day 7, but I'm ending up with an answer of 1 instead of 30. It seems like the problem is that my totals are not carrying up the stack, but I may have something else wrong.

My code is here https://github.com/djotaku/adventofcode/blob/66d74babd2ed37f56858096bc5598149448b6839/2022/Day_13/Python/solution.py