What is an alternation in Y maze?
Y Maze Spontaneous Alternation is a behavioral test for measuring the willingness of rodents to explore new environments. Rodents typically prefer to investigate a new arm of the maze rather than returning to one that was previously visited.
Who invented the T-maze?
Robert Yerkes
The T-maze is a T-shaped apparatus allowing a choice between two opposite arms. A first T-maze apparatus was designed at the beginning of the 1910s by Robert Yerkes (1876–1956) at Harvard University for the study of invertebrate cognition, in particular learning processes in the earthworm5.
What is a water T-maze?
The water T-maze is an egocentric visual spatial learning task that also incorporates reversal learning. The assay consists of an initial acquisition phase in which the mouse is trained to located a hidden platform located on one side (i.e., right or left).
How do you analyze Y maze data?
To test this, one arm of the Y-Maze is blocked off and the animal is allowed to explore the other two arms. The animal’s memory function is tested when the animal is returned to the maze with all arms open and monitored for the tendency to spend time in the new arm or the known arms.
How do you calculate spontaneous alternation in Y maze?
The alternation percentage is calculated by dividing the number of alternations by number of possible triads x 100. The maze is cleaned with Virkon solution between animals to eliminate odor traces.
What is spatial memory used for?
spatial memory, storage and retrieval of information within the brain that is needed both to plan a route to a desired location and to remember where an object is located or where an event occurred.
Why is it called maze?
DID YOU KNOW? The word “maze” dates from the 13th century and comes from the Middle English word mæs, denoting delirium or delusion. The word “labyrinth” may date as far back as the 14th century, and derives from the Latin labyrinthus and the Greek labýrinthos, or, a building with intricate passages.
What is maze learning?
learning to reach the goal object or objects in a maze by starting from a designated point and following various paths, some of which do not lead to the goal.
What is maze problem?
Data StructureBacktracking AlgorithmsAlgorithms. In this problem, there is a given maze of size N x N. The source and the destination location is top-left cell and bottom right cell respectively. Some cells are valid to move and some cells are blocked.