A* algorithm for river crossing problem using python
Budget: $10 – $30 AUD
Problem Description
Farmer, Wolf, Goat and Cabbage Problem
A farmer has a wolf, a goat, and a cabbage on the east side of a
river. He wants to move them to the west side of the river. He has a
boat in which he and only one other thing may fit. The wolf will eat
the goat if they are left together unattended. The goat will eat the
cabbage if they are left together unattended. Generate a plan for the
farmer to safely move all items including himself to the west side of
the river.
Requirements
The problem must be solved using state space search algorithms implemented in the Python programming
language.
Two state space search algorithms:
(1) a blind (Depth-First) search and
(2) a heuristic (A*) search algorithms must be included to complete the task.
Farmer, Wolf, Goat and Cabbage Problem
A farmer has a wolf, a goat, and a cabbage on the east side of a
river. He wants to move them to the west side of the river. He has a
boat in which he and only one other thing may fit. The wolf will eat
the goat if they are left together unattended. The goat will eat the
cabbage if they are left together unattended. Generate a plan for the
farmer to safely move all items including himself to the west side of
the river.
Requirements
The problem must be solved using state space search algorithms implemented in the Python programming
language.
Two state space search algorithms:
(1) a blind (Depth-First) search and
(2) a heuristic (A*) search algorithms must be included to complete the task.