An annotated diagram showing different arrangements of the farmer, wheat, chicken, dog and boat. These diagrams show the transition states from the initial state to the goal state according to the constraints. The diagram is arranged in two sections, each showing a method of solving the problem.
The first version includes eight smaller diagrams showing a sequence of arrangements. The diagrams in sequence left to right across a first row of four and then similarly in a second row of four. The diagrams show this sequence of arrangements of the objects in the scenario.
- The farmer, wheat, chicken, dog and boat are on the left side. Nothing is on the right side.
- The wheat and dog are on the left side. The farmer, chicken and boat are on the right side.
- The farmer, wheat, dog and boat are on the left side. The chicken is on the right side.
- The wheat is on the left side. The farmer, chicken, dog and boat are on the right side.
- The farmer, wheat, chicken and boat are on the left side. The dog is on the right side.
- The chicken is on the left side. The farmer, wheat, dog and boat are on the right side.
- The farmer, chicken and boat are on the left side. The wheat and dog are on the right side.
- Nothing is on the left side. The farmer, wheat, chicken, dog and boat are on the right side.
The second version includes eight smaller diagrams showing a sequence of arrangements. The diagrams in sequence left to right across a first row of four and then similarly in a second row of four. The diagrams show this sequence of arrangements of the objects in the scenario.
- The farmer, wheat, chicken, dog and boat are on the left side. Nothing is on the right side.
- The wheat and dog are on the left side. The farmer, chicken and boat are on the right side.
- The farmer, wheat, dog and boat are on the left side. The chicken is on the right side.
- The dog is on the left side. The farmer, wheat, chicken and boat are on the right side.
- The farmer, chicken, dog and boat are on the left side. The wheat is on the right side.
- The chicken is on the left side. The farmer, wheat, dog and boat are on the right side.
- The farmer, chicken and boat are on the left side. The wheat and dog are on the right side.
- Nothing is on the left side. The farmer, wheat, chicken, dog and boat are on the right side.
A screenshot from the stage in the Edgy programming environment.
The data stored in the variables Acts-Action, Action, Acts-Characters and Acts and an image of a graph are shown. Together, they depict a model of the main characters and main acts of the play Macbeth written by William Shakespeare.
The Acts-Action variable contains a dictionary with the keys ‘Act1’, ‘Act2’, ‘Act3’, ‘Act4’. The values stored for each key are a description of the actions that occur in that act. These have been truncated in the image. The image indicates that there are more keys.
The Acts-Characters variable stores a dictionary with the keys ‘Act1’, ‘Act2’. The image indicates that there are more keys. The value for the key ‘Act1’ is a list of the characters Macbeth, Banquo, Lady Macbeth, Duncan and Witches. The value for the key ‘Act2’ is a list of the characters Macbeth, Duncan and Malcolm.
The Acts variable stores a list. The values ‘Act1’, ‘Act2’ and ‘Act3’ are visible in the image. The image indicates that there are more values.
The image of the graph shows the following nodes (listed from top to bottom): Lady Macbeth, Macbeth, Banquo, Lady Macduff, Fleance, Witches, Macduff, Duncan, Malcolm, Donalbain.
The image of the graph shows the following edges.
- Lady Macbeth – Macbeth with a label ‘married’.
- Macbeth – Banquo with a label ‘death’.
- Macbeth – Lady Macduff with a label ‘death’.
- Macbeth – Witches with a label ‘witness’.
- Macbeth – Macduff
- Banquo – Fleance with a label ‘father-son’
- Lady Macduff – Macduff with a label ‘married’
- Lady Macduff – Duncan
- Macduff – Malcolm
- Duncan – Donalbain
An image of an undirected, connected graph showing relationships between people and hobbies.
The graph has three nodes drawn as blue circles that correspond to three people: Cal, Ann and Ben. The node for Cal is connected by an edge to each of the nodes for Ann and Ben with by an edge labelled ‘friend’.
The graph also has three nodes drawn as orange rectangles, each storing data about the hobbies of one of the three people and connected by an edge labelled ‘likes’ to the node for the corresponding person. The node connected to Ann is labelled “Art, Cooking, Gaming.” The node connected to Cal is labelled “Gaming, Running, Soccer.” The node connected to Ben is labelled “Cooking, Gaming.”
An image of an undirected, connected graph with three nodes showing the distances between three people.
The graph has three nodes drawn as blue circles that correspond to three people: Cal, Ann and Ben. There is an edge labelled ‘2km’ between Ann and Cal. There is an edge labelled ‘10km’ between Cal and Ben. There is an edge labelled ‘8km’ between Ann and Ben.
A call graph is shown of the FriendRecommenderAlgorithm which is shown as a blue rectangular label containing black text that has 6 straight lines connecting it to 6 orange rectangular labels with white text each representing the modules called by FriendRecommenderAlgorithm which include BuildFriendshipModel, InitialiseProximityOnEdges, AdjustProximitybyHobbies, AdjustProximitybyDistanceApart, FloydWarshallShortestPaths, FriendRecommender.