Timeline for ChessMetric - Topcoder Challenge
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 17, 2015 at 5:47 | comment | added | Chris | @James Fargotson: You are also doing a convolution. A simple example of a 2D convolution is here. I use a 2D board with a 2 squares border that is projected onto 1 dimension. In my code the vector 'c' contains the squares on the board (i.e., not the border). -- Note that in general a faster way to compute a convolution is to transpose the vectors to the frequency domain using a fast fourier transform (FFT), doing a multiplication in the frequency domain, and then transforming back. This could possibly increase the performance. | |
| Aug 16, 2015 at 22:50 | comment | added | Josh Horowitz | This is awesome and blazingly fast. Would you mind explaining how it works or linking a resource? After one read I didn't understand the wiki article, but sometimes I don't understand the wiki articles for things I have a pretty good mastery of. Is this a very complex topic that I'll have to spend a day on or is there a simpler explanation (i.e. less math notation)? | |
| Aug 16, 2015 at 9:02 | history | edited | Chris | CC BY-SA 3.0 |
added 19 characters in body
|
| Aug 16, 2015 at 8:50 | history | edited | Chris | CC BY-SA 3.0 |
Added Information / Tried to make to post as readable as possible
|
| Aug 16, 2015 at 8:18 | history | edited | Chris | CC BY-SA 3.0 |
Added Information
|
| Aug 16, 2015 at 7:15 | history | edited | Chris | CC BY-SA 3.0 |
corrected spelling
|
| Aug 16, 2015 at 7:10 | history | edited | Chris | CC BY-SA 3.0 |
added 52 characters in body
|
| Aug 16, 2015 at 0:58 | history | edited | Chris | CC BY-SA 3.0 |
optimized code
|
| Aug 15, 2015 at 23:03 | history | edited | Chris | CC BY-SA 3.0 |
added 42 characters in body
|
| Aug 15, 2015 at 22:36 | history | edited | Chris | CC BY-SA 3.0 |
added 2 characters in body
|
| Aug 15, 2015 at 22:13 | history | answered | Chris | CC BY-SA 3.0 |