src/ch/epfl/maze/physical/zoo/Hamster.java


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66

package ch.epfl.maze.physical.zoo;

import ch.epfl.maze.physical.Animal;
import ch.epfl.maze.physical.ProbabilisticAnimal;
import ch.epfl.maze.util.Direction;
import ch.epfl.maze.util.Vector2D;

import java.util.ArrayList;
import java.util.List;

/**
 * Hamster A.I. that remembers the previous choice it has made and the dead ends
 * it has already met.
 *
 * @author Pacien TRAN-GIRARD
 */

public class Hamster extends ProbabilisticAnimal {

    private final List<Vector2D> deadPaths;

    /**
     * Constructs a hamster with a starting position.
     *
     * @param position Starting position of the hamster in the labyrinth
     */

    public Hamster(Vector2D position) {
        super(position);
        this.deadPaths = new ArrayList<>();
    }

    /**
     * Discard directions known to lead to dead ends.
     *
     * @param choices An array of choices
     * @return An array of smart choices
     */

    private Direction[] excludeDeadPaths(Direction[] choices) {
        List<Direction> smartChoices = new ArrayList<>();

        for (Direction dir : choices)
            if (!this.deadPaths.contains(this.getPosition().addDirectionTo(dir)))
                smartChoices.add(dir);

        return smartChoices.toArray(new Direction[smartChoices.size()]);
    }

    /**
     * Moves without retracing directly its steps and by avoiding the dead-ends
     * it learns during its journey.
     */

    @Override
    public Direction move(Direction[] choices) {
        Direction[] smartChoices = this.excludeDeadPaths(choices);
        if (smartChoices.length == 1) this.deadPaths.add(this.getPosition()); // dead end
        return super.move(smartChoices);
    }

    @Override
    public Animal copy() {
        return new Hamster(this.getPosition());
    }
}