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.
Adds 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)
Adds function is_valid_path that checks if a hex path is a valid path through the maze
Adds 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)
Adds function get_hexes_within_distance that returns all hexes within a given min_distance and max_distance from another hex in the maze
Closes issue #10
Adds 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)Adds function
is_valid_paththat checks if a hex path is a valid path through the mazeAdds 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)Adds function
get_hexes_within_distancethat returns all hexes within a given min_distance and max_distance from another hex in the maze