Using Python, make a simple satisficing Minecraft crafting planner. Given an initial state, you will want to find a series of actions that gets you to a desired goal state. You will also use your implementations for Dijkstras and A* to show how they don't do well in a search space this large (without a lot of tweaking).

In this assignment you will:

* Parse and process a data file into a format that is usable in your code * Create a representation of a state space such that you can check preconditions and apply effects in an efficient manner * Create a method to convert the intuitive predicate based state system into a propositional system * Implement Width-Search utilizing Iterative Widening to efficiently find a plan that gets from an arbitrary state space to a desired state space * Compare Width-Search to optimal search methods such as Dijkstra's and A* to see how they compare in what they can efficiently solve