PLEASE FINISH BY WED Intelligent Systems Project

Write a C$++$ program that solve the Sokoban problem.

Instructions:

Teamwork of $3$ students

Deadline $03/05/2021$

There will be a discussion with each time.

Any code copy from the internet or help from anyone outside the team will lead to a grade of

zero.

The problem has an environment surrounded by a wall. There is a person, a set of $n$ goal positions

and the same number of boxes. The man must move $n$ box to the goal positions. There is no

difference between the goal positions. The man can only move in the free space. He can push boxes

but cannot pull them. In intelligent solution will involve moving all boxes with minimum, number of

steps. Here is an example of $99$ array that represent the same environment to the right.

Where B: Box, M: Man, W: Wall, G: goal, X: Box on Goal

When the game starts we input location of the man at $(x,Y)$ where $x,Y$ is an empty cell.

The top left corner is the location $(0,0)$

Here is the goal state for the above problem.

Solve this problem using Q$-$learning on a grid of $99.$ For more information look at