wbsth / cs50ai

CS50's Introduction to Artificial Intelligence with Python - projects solutions

hello there 🤠

cs50ai's Issues

Hello there! question regarding project 0 (degree.py)

Hello fellow
Thanks for posting your solutions

I took a look on the degree.py solution. In the shortest_path function, the code segment:

        if node.state == target:
            rt = []

            while node.parent is not None:
                rt.append((node.action, node.state))
                node = node.parent

            rt.reverse()
            return rt

is it necessary? I run with that segment commented and I think it is working pretty well without it taking in consideration that the same validation is done inside the for loop. I am just asking to learn. Thanks in advance.