Cody

Richard Zapor

14
Rank
17
Badges
14835
Score

Activities

1 – 50 of 2,343

Richard Zapor submitted Solution 1188682 to Problem 1512. Clock Solitaire

on 14 May 2017 at 20:57

Richard Zapor submitted Solution 1188681 to Problem 1512. Clock Solitaire

on 14 May 2017 at 20:54

Richard Zapor submitted Solution 1188680 to Problem 1512. Clock Solitaire

on 14 May 2017 at 20:53

Richard Zapor submitted Solution 1188679 to Problem 1512. Clock Solitaire

on 14 May 2017 at 20:51

Richard Zapor submitted a Comment to Problem 1512. Clock Solitaire

Please add a test case that kills my invalid leading solution. I misinterpreted the wiki page for sequencing which I thought was random choice to produce a 1 in 13 probability.

on 14 May 2017 at 19:01

Richard Zapor submitted Solution 1188651 to Problem 1512. Clock Solitaire

on 14 May 2017 at 18:53

Richard Zapor submitted Solution 1188650 to Problem 1512. Clock Solitaire

on 14 May 2017 at 18:48

Richard Zapor received Indexing I Master badge

on 3 Nov 2016

Richard Zapor submitted a Comment to Problem 42877. Cellular Automaton | Rule X

The example does not match the solutions. First puzzle(30,3) has [0 1 1 0 ...] as next to last row with an expected [0 1 0]. The example shows this as [1 1 0]

on 18 Jun 2016

Richard Zapor submitted a Comment to Solution 889756

Tim created another superb solution. The highlights are an elegant center of square's determination using ndgrid. The crux of his method is a convolution for each square not using "same" with an interesting centroid kernel. The comparison between all square convolutions for all rotations utilizes a concise norm metric function. The method should work on non-binary images. The best six matches from the 180x180 upper triangle error array are handily converted into the output format. Thank You Tim for this elegant solution.

on 14 May 2016

1 – 50 of 2,343