18 |
35 |
36 |
37 |
41 |
42 | 
102 |
103 |
108 |
109 |
110 |
111 |
112 |
--------------------------------------------------------------------------------
/levels.js:
--------------------------------------------------------------------------------
1 |
2 |
3 | const Level = {
4 | init: function(){
5 | if (this.addition > 0) {
6 | this.successor = Math.floor(Math.random() * (this.addition) + 1)
7 | } else if (this.addition < 0) { // range from negative 1 to negative N
8 | this.successor = Math.floor(Math.random() * (this.addition * -1) + 1) * -1
9 | }
10 | },
11 | num_cats: function(){
12 | return Math.floor(Math.random() * (this.max + 1 - this.min)) + this.min
13 | },
14 | get_value: function(key) {
15 | // fetch a value in the level using rich
16 | // specifiers, like a list of possible values
17 | let value = this[key]
18 | if (Array.isArray(value)) {
19 | value = value[Math.floor(Math.random()*value.length)]
20 | }
21 | return value
22 | },
23 | chance: function() {
24 | if (this.operator === 'or') return 0.6 - 0.1 * this.num_atts;
25 | else return 0.4 + 0.1 * this.num_atts;
26 | },
27 | min: 0,
28 | max: 9,
29 | operator: 'and',
30 | get_num_adjectives: function(keys) { // no semantic difference, just use adjectives in sentence structure.
31 | if (this.num_adjectives !== null) return this.num_adjectives
32 | return Math.floor(Math.random()*keys.length)
33 | },
34 | num_adjectives: null, // by default, it's random.
35 |
36 | max_asked_atts: 99, // no more than this many atts asked. normally don't set.
37 |
38 | num_atts: 3, // attributes to apply to cats
39 | att_chance: 1,
40 | set_avail_atts: function() {
41 | ATTS = [
42 | pick_rand(COLOR_ATTS),
43 | pick_rand(MOTION_ATTS),
44 | pick_rand(ANIMAL_ATTS)
45 | ].slice(0,this.num_atts)
46 | },
47 | negation: false,
48 | get_stars: function() {
49 | return parseInt(localStorage[this.get_key()] || '0')
50 | },
51 | add_star: function() {
52 | localStorage[this.get_key()] = Math.min(this.get_stars() + 1, 5)
53 | },
54 | get_key: function() {
55 | return this.name.replace(/\s/g, '-')
56 | },
57 | lose_stars: function() {
58 | localStorage[this.get_key()] = 0
59 | },
60 | get_equality_operator: function() {
61 | if (this.successor) {
62 | return 'would be'
63 | } else {
64 | return 'are'
65 | }
66 | },
67 | get_added_num: function() {
68 | if (this.successor) {
69 | return this.successor
70 | } else {
71 | return 0
72 | }
73 | }
74 | }
75 |
76 |
77 | const TOPICS = [
78 | {
79 | name: 'counting',
80 | stages: [
81 | {
82 | name: 'little cardinals',
83 | min: 1,
84 | max: 3,
85 | max_asked_atts: 0,
86 | num_atts: 0
87 | },
88 | {
89 | name: 'big cardinals',
90 | min: 4,
91 | max_asked_atts: 0,
92 | num_atts: 0
93 | },
94 | {
95 | name: 'distraction',
96 | min: 1,
97 | max: 7,
98 | max_asked_atts: 0,
99 | num_atts: 1
100 | },
101 | {
102 | name: 'big distraction',
103 | min: 1,
104 | max_asked_atts: 0,
105 | num_atts: 3
106 | },
107 | {
108 | name: 'with zero',
109 | max: 2,
110 | max_asked_atts: 0,
111 | num_atts: 3
112 | },
113 | {
114 | name: 'counting mastery',
115 | num_atts: 3,
116 | max_asked_atts: 0
117 | }
118 | ]
119 | },
120 | {
121 | name: 'subsets',
122 | stages: [
123 | {
124 | name: 'little subset',
125 | min: 2,
126 | max: 3,
127 | max_asked_atts: 1,
128 | num_atts: 1,
129 | num_adjectives: 0
130 | },
131 | {
132 | name: 'subset',
133 | min: 4,
134 | max: 5,
135 | max_asked_atts: 1,
136 | num_atts: 1,
137 | num_adjectives: 0
138 | },
139 | {
140 | name: 'big subset',
141 | min: 4,
142 | max: 7,
143 | max_asked_atts: 1,
144 | num_atts: 1,
145 | num_adjectives: 0
146 | },
147 | {
148 | name: 'adjectives',
149 | min: 2,
150 | max: 7,
151 | max_asked_atts: 1,
152 | num_adjectives: 1,
153 | num_atts: 1
154 | },
155 | {
156 | name: 'subset distraction',
157 | min: 3,
158 | max: 5,
159 | max_asked_atts: 2,
160 | num_atts: 2
161 | },
162 | {
163 | name: 'big subset distraction',
164 | min: 4,
165 | max_asked_atts: 2
166 | },
167 | {
168 | name: 'subset with zero',
169 | max: 2,
170 | max_asked_atts: 1,
171 | num_atts: 1
172 | },
173 | {
174 | name: 'subset mastery',
175 | max_asked_atts: 3
176 | }
177 | ]
178 | },
179 | {
180 | name: 'operators',
181 | stages: [
182 | {
183 | name: 'little negation', // how many cats are not A
184 | negation: true,
185 | min: 2,
186 | max: 4,
187 | num_atts: 1
188 | // returns whether a given value is to be negated.
189 | },
190 | {
191 | name: 'big negation', // how many cats are not A
192 | negation: true,
193 | num_atts: 2
194 | // returns whether a given value is to be negated.
195 | },
196 | {
197 | name: 'intersection', // how many A cats are B
198 | max_asked_atts: 2,
199 | num_atts: 2,
200 | min: 2, max: 5,
201 | num_adjectives: 1
202 | },
203 | {
204 | name: 'conjunction', // how many A cats are B
205 | max_asked_atts: 2,
206 | num_atts: 2,
207 | min: 2, max: 5,
208 | num_adjectives: 0
209 | },
210 | {
211 | name: 'union',
212 | max_asked_atts: 2,
213 | num_atts: 2,
214 | min: 2, max: 5,
215 | num_adjectives: 0,
216 | operator: 'or'
217 | },
218 | {
219 | name: 'disjunction',
220 | max_asked_atts: 2,
221 | num_atts: 2,
222 | min: 2, max: 5,
223 | num_adjectives: 0,
224 | operator: 'or'
225 | },
226 | {
227 | name: 'triple intersection', // how many A cats are B and C
228 | max_asked_atts: 3,
229 | num_atts: 3,
230 | min: 4, max: 7,
231 | num_adjectives: 1
232 | },
233 | {
234 | name: 'operator mastery', // how many A cats are B and C
235 | max_asked_atts: 3,
236 | num_atts: 3,
237 | min: 2, max: 9,
238 | num_adjectives: 0,
239 | operator: 'or',
240 | negation: [false, false, true]
241 | }
242 | ]
243 | },
244 | {
245 | name: 'arithmetic group',
246 | stages: [
247 | {
248 | name:'successor', // if we had another, how many cats would there be
249 | successor: 1,
250 | num_adjectives: 0,
251 | max_asked_atts: 0,
252 | max: 3,
253 | num_atts: 0
254 | },
255 | {
256 | name:'successor successor', // if we had two more, how many cats would there be?
257 | successor: 2,
258 | num_adjectives: 0,
259 | max_asked_atts: 0,
260 | num_atts: 0,
261 | max: 7
262 | },
263 | {
264 | name:'addition', // if we had two more, how many cats would there be?
265 | addition: 4,
266 | num_adjectives: 0,
267 | max_asked_atts: 0,
268 | num_atts: 0,
269 | max: 6
270 | },
271 | {
272 | name:'inverse successor', // if we had two more, how many cats would there be?
273 | successor: -1,
274 | num_adjectives: 0,
275 | max_asked_atts: 0,
276 | num_atts: 0,
277 | min: 1
278 | },
279 | {
280 | name:'subtraction', // if we had two more, how many cats would there be?
281 | addition: -4,
282 | num_adjectives: 0,
283 | max_asked_atts: 0,
284 | num_atts: 0,
285 | min: 4
286 | },
287 | {
288 | name: 'successor subset', // if we had another pink cats, how many pink cats would there be?
289 | successor: 1,
290 | num_adjectives: 0,
291 | max_asked_atts: 1,
292 | num_atts: 1,
293 | max: 8
294 | },
295 | {
296 | name: 'addition subset', // if we had two more pink cats, how many pink cats would there be?
297 | addition: 4,
298 | num_adjectives: 0,
299 | max_asked_atts: 1,
300 | num_atts: 1,
301 | max: 5
302 | },
303 | {
304 | name: 'subtraction subset', // if we had two less pink cats, how many cats would there be?
305 | addition: -4,
306 | num_adjectives: 0,
307 | max_asked_atts: 1,
308 | num_atts: 1,
309 | min: 4
310 | }
311 | ]
312 | }/*,
313 | {
314 | name: 'word problems',
315 | stages: [
316 | 'supposition', // if all red cats were blue, how many red cats?
317 | 'independence', // if all red cats were blue, how many spinning cats?
318 | 'supremum', // what is the most cats that is less than the number of red cats?
319 | 'infimum', // what is the least cats that is more than the number of red cats?
320 | 'implication' // how many cats obey/break the rule 'red cats must be spinning'
321 | ]
322 | }*/
323 | ]
324 |
325 | h = ''
326 | for (j=0;j