The objective is to find what the next number is.
0, 1, 1, 0, 2, 0, 0, 0, 0, 1, 1, 0, 2, 0, 0, 0, 0, 1, 1, 2, 2, 0, 0, 0, 0, 1, 0, 2, 2, 0, 0, 0, 0, 1, 0, 2, 1, 0, 2, 0, 0, 0, 0, 2, 1, 0, 2, 0, 0, 0, 0, 2, 1, 0, 2, 0, 0, 0, 0, 1, 1, 0, 2, 0, 0, 0, 0, 1, 1, 2, 2, 0, 0, 0, 0, 1, 0, 2, 1, 0, 0, 0, 0, 1, 0, 2, 1, 0, 2, 0, 0, 1, 0, 2, 1, 0, 2, 0, 0, 0, 0, 2, 1, 0, 2, 0, 0, 0, 0, 1, 1, 2, 2, 0, 0, 0, 0, 1, 0, 2, 2, 0, 0, 0, 0, 1, 0, 2, 1...
After every day, a number gets added onto the end of the list (it's either a 0, 1 or a 2). So the only way to know if we're right is to wait till the next day...
Anybody have any ideas as to how to approach this? It seems there's a pattern but it just hurts me.
Edit: Context is as follows...
In a city there are 2 houses. House 1 is north, and house 2 is south.
The owners of those houses might become forgetful and leave their house for the day with their door unlocked.
0 represents that both doors are locked (they are not accessible).
1 represents the northern house is unlocked. 2 represents the southern house is unlocked.
Only 1 house can be unlocked at a time. Either one house is unlocked, or both are not.
Edit2: 23/02/2018: 0
Edit3: 24/02/2018: 2
Edit4: 25/02/2018: 1
0 represents that both doors are locked (they are not accessible). 1 represents the northern house is unlocked. 2 represents the southern house is unlocked.
Only 1 house can be unlocked at a time. Either one house is unlocked, or both are not.
– Qmi Feb 22 '18 at 12:20