/
stories
134 lines (88 loc) · 3.41 KB
/
stories
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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
--------------------------------------------------------------------------------
Implement the clone() method for the graph
Complete: Yes
Assigned to: Andrew
Due: 2012-11-19
Size: ***
Priority: High
As a designer, I want to be able to copy the graph.
Acceptance criterion: util.Graph.clone() makes a deep copy of the graph.
--------------------------------------------------------------------------------
Implement the containsEdge method for the graph
Complete: Yes
Assigned to: Andrew
Due: 2012-11-19
Size: *
Priority: High
As a designer, I want to be able to query the graph for the presence of an edge
between two elements contained therein.
Acceptance criterion: util.Graph.containsEdge acts as expected.
--------------------------------------------------------------------------------
Implement breadth-first search
Completed: Yes
Assigned to: Andrew
Due: 2012-11-26
Completed: 2012-11-19
Size: ***
Priority: High
As a designer, I want path finding to be able to use a breadth-first algorithm.
Acceptance criterion: path finding can use a breadth-first algorithm
--------------------------------------------------------------------------------
Implement best-first without a heuristic
Completed: Yes
Assigned to: Andrew
Due: 2012-11-19
Size: ***
Priority: High
As a designer, I want path finding to be able to use a best-first algorithm
with a constant heuristic function (uniform-cost).
Acceptance criterion: path finding can use a best-first algorithm with a
constant heuristic function (uniform-cost).
--------------------------------------------------------------------------------
Implement AI jumping
Completed: No
Assigned to: John
Due: 2012-11-19
Size: *****
Priority: High
As a robot, I want the AI to jump when appropriate.
Acceptance criterion: an AI can jump other players without breaking rules.
--------------------------------------------------------------------------------
Win Test Timing
Complete: No
Assigned to: John
Due: 2012-12-03
Size: 1
Priorit: High
As a user, I want to be notified immediately when a player wins.
Acceptance criterion: when a player wins, the game notifies the user
immediately.
--------------------------------------------------------------------------------
Implement basic networking
Completed: No
Assigned to: Nick
Due: 2012-11-11
Size:
Priority:
As a user, I want to be able to make a connection to the game.
Acceptance criterion:
--------------------------------------------------------------------------------
Implement shortest path AI without jumping
Completed: Yes
Assigned to: Andrew
Due: 2012-12-03
Size: 1
Priority: High
As a player, I want the AI to move toward its goal.
Acceptance criterion: the AIs move toward their goal, but jumping doesn't work
yet.
--------------------------------------------------------------------------------
Implement wall-placing AI
Completed: No
Assigned to: everyone
Due: 2012-12-03
Size: 8
Priority: Med
As a user, I want the AI to place walls.
Acceptance criterion: the AI places walls.
--------------------------------------------------------------------------------