| ??? 10/05/11 07:01 Modified: 10/05/11 07:07 Read: times |
#184041 - A quick question |
Thinking about this today,On my android phone there is a screen lock feature where you have to draw a pattern connecting a grid of 9 points, each point can only have two lines going to it,you don't have to connect all the points,so you have to connect at least two points, how many possible patterns are there, and is there a proof for an arbitrary size grid of points?
I am sure you could solve it programatically but I am after an analytic answer |
| Topic | Author | Date |
| A quick question | 01/01/70 00:00 | |
| Many patterns complex/hard to enter | 01/01/70 00:00 | |
| oohh | 01/01/70 00:00 | |
| 9 points grid (3x3) 4lines ? | 01/01/70 00:00 | |
| Yes and no | 01/01/70 00:00 | |
| 3x3 grid in real life | 01/01/70 00:00 | |
| Not at all - goal is security, not puzzle | 01/01/70 00:00 | |
| Only one way to to connect 3x3 with 4 lines | 01/01/70 00:00 | |
| Stupid | 01/01/70 00:00 | |
| Stupid opinion | 01/01/70 00:00 | |
| Yes, I do know the solution | 01/01/70 00:00 | |
| Patterns ... | 01/01/70 00:00 | |
| No time. No acceleration. No lift. No finger outside screen. | 01/01/70 00:00 | |
Password Glyphs | 01/01/70 00:00 |