Description Usage Arguments Details Author(s) See Also Examples

This generate the solution by searching for the SEED that returns the specific number of paths to achieve the maximum score for a given rank and saturation.

1 2 | ```
genEMLseed(path = 3, rank = 5, satPercent = 0.5, seed = 1,
runSeed = 500)
``` |

`path` |
Selecting the specific number of paths to achieve the maximum score. |

`rank` |
This is the rank of the maze. |

`satPercent` |
This is of saturation percentage ranging from 0-1. |

`seed` |
The starting seed to begin searching for the seed with specific paths. |

`runSeed` |
This determines the number of searches for the specific paths before stopping. |

This might be computationally intensive as the maze size increases. The seed is necessary so that the algorithm does not always begin from the smallest seed value. Based on the starting seed value, it will search for the next seed that returns the desired number of path defined by the user. To limit the search time, The function will stop looking for the seed based on the runSeed value. Using this function will guarantee that the minimum number of steps to achieve the maximum score will be the same for all possible paths. If the number of steps does not need to be equal across all possible paths for the maximum score, please use the `genPathSeed`

function instead.

Aiden Loe and Maria Sanchez

1 2 3 4 5 6 7 8 9 10 11 12 13 | ```
rank <- 5
satPercent <- 0.5
seed <- 1
#Search for just one unique path
justOne <- genEMLseed(path=1,rank=rank,satPercent=satPercent,seed=seed)
nodePosition <- np(rank,satPercent,seed=justOne)
mazeEst(nodePosition)
#Search for three path
justThree <- genEMLseed(path=3,rank=rank,satPercent=satPercent,seed=seed, runSeed=300)
nodePosition <- np(rank,satPercent,seed=justThree)
mazeEst(nodePosition)
``` |

Aidenloe/mazeGen documentation built on Dec. 6, 2017, 12:25 a.m.

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.