This returns the estimate of various maze parameters.
Tells you all the position of the black dots.
This function calculates the count of all the possible black node routes, the maximum score one can achieve for a given rank of a colour node position, all the minimum routes possible, and all the possible routes.
The rank of the maze
The location of the coloured dots
The maximum score achievable in the maze.
All possible routes that passes a certain number of black dots
The minimum steps to achieve the maximum score
The number of paths with the minimum steps to achieve the maximum score.
All the paths with the minimum steps to achieve the maximum score.
The number of possible paths to achieve the maximum score.
All possible paths to achieve the maximum score.
Davies, A. D., & Davies, M. G. (1965). The difficulty and graded scoing of Elithorn
's perceptual maze test. British Journal of Psychology, 56(2-3), 295-302.
Davies, M. G., & Davies, D. M. (1965). Some analytical properties of Elithorn
's perceptual maze. Journal of Mathematical Psychology, 2(2), 371-380.
1 2 3
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.