Code to generate, plot, and calculate info about hex maze configurations and optimal barrier change sequences for the hex maze behavioral task used by the Berke Lab at UCSF.
1
stars
2
forks
source link
Add functions to identify all choice hexes, check hex paths, and split maze into sections #10
Add function get_all_choice_points that given a hex maze configuration, returns a list of all hexes where the rat has a choice to make (aka a hex that borders 3 open hexes)
(the hex(es) returned by get_critical_choice_points should be a subset of the hexes returned by this function)
Add function is_valid_path that checks if a hex path is a valid path through the maze
Add function divide_into_thirds that divides a hex maze with a single choice point into 3 sections (all hexes between the choice point and port 1, between choice and port 2, and between choice and port 3)
Add function
get_all_choice_pointsthat given a hex maze configuration, returns a list of all hexes where the rat has a choice to make (aka a hex that borders 3 open hexes)get_critical_choice_pointsshould be a subset of the hexes returned by this function)Add function
is_valid_paththat checks if a hex path is a valid path through the mazeAdd function
divide_into_thirdsthat divides a hex maze with a single choice point into 3 sections (all hexes between the choice point and port 1, between choice and port 2, and between choice and port 3)