Description Usage Arguments Details Value Author(s) See Also Examples
View source: R/hexaflake_maze.r
Recursively draw a hexaflake maze, a cross between a Koch snowflake
and a Sierpinski triangle. The outer part of the flake consists of
a hexagon of side length 3^{depth} pieces of length
unit_len
. The ‘inner’ and ‘outer’ pieces of
the flake are mazes drawn in different colors.
1 2 3 4 5  hexaflake_maze(depth, unit_len, clockwise = TRUE, start_from = c("midpoint",
"corner"), color1 = "black", color2 = "gray40", draw_boundary = FALSE,
num_boundary_holes = 2, boundary_lines = TRUE, boundary_holes = NULL,
boundary_hole_color = NULL, boundary_hole_locations = NULL,
boundary_hole_arrows = FALSE, end_side = 1)

depth 
the depth of recursion. This controls the side length. Should be an integer. 
unit_len 
the unit length in graph coordinates. This controls the width of the ‘holes’ in the boundary lines and generally controls the spacing of mazes. 
clockwise 
whether to draw clockwise. 
start_from 
whether to start from the midpoint of the first side of a maze, or from the corner facing the first side. 
color1 
The dominant color of the maze. 
color2 
The negative color of the maze. 
draw_boundary 
a boolean indicating whether a final boundary shall be drawn around the maze. 
num_boundary_holes 
the number of boundary sides which should be
randomly selected to have holes. Note that the 
boundary_lines 
indicates which of the sides of the maze shall have drawn boundary lines. Can be a logical array indicating which sides shall have lines, or a numeric array, giving the index of sides that shall have lines. 
boundary_holes 
an array indicating which of the boundary lines
have holes. If 
boundary_hole_color 
the color of boundary holes. A value of

boundary_hole_locations 
the ‘locations’ of the boundary holes
within each boundary segment.
A value of 
boundary_hole_arrows 
a boolean or boolean array indicating whether to draw perpendicular double arrows at the boundary holes, as a visual guide. These can be useful for locating the entry and exit points of a maze. 
end_side 
the number of the side to end on. A value of
1 corresponds to the starting side, while higher numbers
correspond to the drawn side of the figure in the canonical order
(that is, the order induced by the 
Draws a maze in an Hexflake. Relies on generation of hexagonal and triangular mazes for the internals. An internal hexagon and six surrounding hexagons are recursively drawn as hexaflakes, connected by 12 equilateral triangles, drawn in the secondary color:
nothing; the function is called for side effects only, though in the future this might return information about the drawn boundary of the shape.
Steven E. Pav [email protected]
1 2 3 4 5 6 7 8  library(TurtleGraphics)
turtle_init(1000,1000,mode='clip')
turtle_hide()
turtle_do({
turtle_setpos(50,500)
turtle_setangle(0)
hexaflake_maze(depth=3,unit_len=10,draw_boundary=TRUE,color2='green')
})

Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.