General Formula for possible combinations of Android-lock NxN matrix
There was a similar Post here for a 3x3 Matrix: android lock password combinations .
I'm not able to figure out a formula to find the possible combinations in general with a NxN matrix.
My Phone for example has the possibility to chose between a 5x5 and a 6x6 Matrix
for my unlock pattern and i would like to know how much more secure the 6x6 is in comparison to 5x5.
Restrictions for the patterns are: Minimum 1 Point, maximum N*N points, no point can be hit 2 times and you can't skip points in diagonal, horizontal and vertical lines from the actual point of your pattern.
android matrix passwords combinations combinatorics asked Nov 22 at 13:34
Sphingidae
62
add a comment |
There was a similar Post here for a 3x3 Matrix: android lock password combinations .
I'm not able to figure out a formula to find the possible combinations in general with a NxN matrix.
My Phone for example has the possibility to chose between a 5x5 and a 6x6 Matrix
for my unlock pattern and i would like to know how much more secure the 6x6 is in comparison to 5x5.
Restrictions for the patterns are: Minimum 1 Point, maximum N*N points, no point can be hit 2 times and you can't skip points in diagonal, horizontal and vertical lines from the actual point of your pattern.
android matrix passwords combinations combinatorics asked Nov 22 at 13:34
Sphingidae
62
1
Hello and welcome to Stack Overflow. In order for someone to answer you, you must provide the code and efforts that you have tried.
– cmprogram
Nov 22 at 13:56
The question is actually about a general abstract algorithm, so I wouldn't necessarily expect any code yet.
– Royce Williams
Nov 22 at 16:35
add a comment |
There was a similar Post here for a 3x3 Matrix: android lock password combinations .
I'm not able to figure out a formula to find the possible combinations in general with a NxN matrix.
My Phone for example has the possibility to chose between a 5x5 and a 6x6 Matrix
for my unlock pattern and i would like to know how much more secure the 6x6 is in comparison to 5x5.
Restrictions for the patterns are: Minimum 1 Point, maximum N*N points, no point can be hit 2 times and you can't skip points in diagonal, horizontal and vertical lines from the actual point of your pattern.
android matrix passwords combinations combinatorics asked Nov 22 at 13:34
Sphingidae
62
There was a similar Post here for a 3x3 Matrix: android lock password combinations .
I'm not able to figure out a formula to find the possible combinations in general with a NxN matrix.
My Phone for example has the possibility to chose between a 5x5 and a 6x6 Matrix
for my unlock pattern and i would like to know how much more secure the 6x6 is in comparison to 5x5.
Restrictions for the patterns are: Minimum 1 Point, maximum N*N points, no point can be hit 2 times and you can't skip points in diagonal, horizontal and vertical lines from the actual point of your pattern.
android matrix passwords combinations combinatorics android matrix passwords combinations combinatorics asked Nov 22 at 13:34
Sphingidae
62
asked Nov 22 at 13:34
Sphingidae
62
edited Nov 22 at 13:39
asked Nov 22 at 13:34
Sphingidae
62
asked Nov 22 at 13:34
Sphingidae
62
asked Nov 22 at 13:34
Sphingidae
62
62
1
Hello and welcome to Stack Overflow. In order for someone to answer you, you must provide the code and efforts that you have tried.
– cmprogram
Nov 22 at 13:56
The question is actually about a general abstract algorithm, so I wouldn't necessarily expect any code yet.
– Royce Williams
Nov 22 at 16:35
add a comment |
1
Hello and welcome to Stack Overflow. In order for someone to answer you, you must provide the code and efforts that you have tried.
– cmprogram
Nov 22 at 13:56
The question is actually about a general abstract algorithm, so I wouldn't necessarily expect any code yet.
– Royce Williams
Nov 22 at 16:35
1
1
Hello and welcome to Stack Overflow. In order for someone to answer you, you must provide the code and efforts that you have tried.
– cmprogram
Nov 22 at 13:56
Hello and welcome to Stack Overflow. In order for someone to answer you, you must provide the code and efforts that you have tried.
– cmprogram
Nov 22 at 13:56
The question is actually about a general abstract algorithm, so I wouldn't necessarily expect any code yet.
– Royce Williams
Nov 22 at 16:35
The question is actually about a general abstract algorithm, so I wouldn't necessarily expect any code yet.
– Royce Williams
Nov 22 at 16:35
add a comment |
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53432170%2fgeneral-formula-for-possible-combinations-of-android-lock-nxn-matrix%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53432170%2fgeneral-formula-for-possible-combinations-of-android-lock-nxn-matrix%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
Hello and welcome to Stack Overflow. In order for someone to answer you, you must provide the code and efforts that you have tried.
– cmprogram
Nov 22 at 13:56
The question is actually about a general abstract algorithm, so I wouldn't necessarily expect any code yet.
– Royce Williams
Nov 22 at 16:35