Problem 47453. Slitherlink I: Trivial
This challenge is to solve Slitherlink pencil puzzles. An essential starter guide is Slitherlink Techniques. An s matrix with values from 0:5 is provided. An s of 5 means this locations edges are not provided and may be from 0:3. The player will be given the s, c, and initial p matrices. The c matrix is clarified for the creation of the solution path of nodes as given in c. The p matrix is a [numel,numel] matrix of c indices where p(x,y)=1 is a possible node connection. p(1,2)=1 as well as example's p(1,5)=1. Additional details of p are provided in the function template. Function template also includes visualization code.
This Slitherlink I: Trivial is for the cases of s with a 4 or a pair of adjacent 3s forming a unique solution loop.
Slitherlink II: Gimmes will use the Starting Techniques from Slitherlink Techniques. Adjacent 3s yields R 3 R 3 R board values if trivial did not already solve.
Input: s, matrix of edge counts of the unique solution path; (c,p,bsegs,emap,pmap) are provided but not required
Output: sv, a vector of path nodes where sv(1)=sv(end). These nodes correspond to values in the c matrix example.
Slitherlink II: Gimmes, Slitherlink III: Evolve, Slitherlink IV: Recursive (medium), Slitherlink V: Assert/Evolve/Check (large)
Solution CommentsShow comments
Problem Recent Solvers3