7COM1034: Theory and Practice of Artificial Intelligence - Decanting Problem - Computer Science Assessment Answer

Computer Science Assessment Task

Goal Starting with a particular start configuration, find a sequence of moves such that a goal configuration is reached (in the example from Sec. 1.1.1, that is (f1, f2, f3) = (4, 0, 4).

1.1.3 The Task Based on the search algorithms covered in the lecture, write a Python program that starts from some starting state,

(f1, f2, f3) and moves according to the rules until it reaches a given goal state for the decanting task. Your solution must at least be able to solve the example from Sec. 1.1.1, but should be more general than that, in that it allows for larger number of vessels and different fillings.

For this, you have to adapt the search algorithms introduced in the lecture presented in the lecture and apply it to a Decant class which you have to write. Keep in mind that a naive depth-first search need not work, as the problem can repeat positions.

1.1.4 Detailed Instructions and Marking Scheme Core Tasks You need to write a class Decant and define for it (at least) the following class methods:

1. start(self): returns the starting state for the decanting task.

There are different ways of representing the board — whatever you choose to do, make sure you give a clear comment how you decided to represent the state.

2. goal(self, node): returns True if the configuration node is a goal configuration, i.e. if it fulfils the target requirement (in the example from Sec. 1.1.1, two vessels with 4 litres each)

3. succ(self, node): yields successively all the successors of the configuration indicated by node.

This Computer Science Assessment has been solved by our Computer Science experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.

Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.