Timeline for Create an N-Dimensional Simplex (Tetrahedron)
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot | Commonmark migration | |
| Jan 13, 2018 at 2:00 | history | edited | PattuX | CC BY-SA 3.0 | added 333 characters in body |
| Jan 10, 2018 at 16:45 | comment | added | Alex Varga | 66 bytes combining previous comments | |
| Jan 8, 2018 at 11:51 | comment | added | Rod | You can change to way to generate the identity matrix to save 8 bytes | |
| Jan 8, 2018 at 10:10 | comment | added | alephalpha | -2 bytes: lambda n:[[n*int(i==j)for i in range(n)]for j in range(n)]+[n*[1+(n+1)**.5]] | |
| Jan 8, 2018 at 5:56 | comment | added | ATaco | Yep, such is the annoying power of simplexes | |
| Jan 8, 2018 at 4:26 | history | edited | PattuX | CC BY-SA 3.0 | remove spaces |
| Jan 8, 2018 at 4:21 | comment | added | PattuX | After reading a bit more, isn't every pair of different numbers a 1-simplex? | |
| Jan 8, 2018 at 4:18 | history | edited | PattuX | CC BY-SA 3.0 | add explanation |
| Jan 8, 2018 at 4:09 | history | edited | PattuX | CC BY-SA 3.0 | fix solution (last point had one coord to much) |
| Jan 8, 2018 at 3:56 | comment | added | ATaco | Although not in the scope of this challenge, 0 dimensional simplexes are also a thing, as horrible as that may sound. | |
| Jan 8, 2018 at 3:54 | history | answered | PattuX | CC BY-SA 3.0 |