HW# 3 .1 (Frog Puzzle)

  • Due Mar 4, 2022 by 11:59pm
  • Points 96
  • Submitting a file upload
  • File Types zip
  • Available after Feb 21, 2022 at 12pm

hw#3.1.frog.puzzle.zip Download hw#3.1.frog.puzzle.zip

Below is an illustration how state space tree of the frog puzzle  is constructed by the BFS (Breadth First Search) method that uses a Python list as a FIFO (First-in, First-out) queue 

hw#3.frog.puzzle.queue.png

 

Below is a program for illutration that can get all the transitions from root to leaf with the backtrace technique.

hw#3.1.backtrace.ipynb Download hw#3.1.backtrace.ipynb

1646467140 03/04/2022 11:59pm