Stack Exchange
log in

user1502040

 Discussion between new Q Open Wid and…

Imported from a comment discussion on puzzling.stackexchange.c...
user1502040
Aug 15, 2023 21:59
e.g. (row first, zero-based):
[(6, 3), (6, 4), (6, 5), (6, 6), (6, 7), (5, 7), (4, 7), (4, 8), (4, 9)]
[(6, 3), (7, 3), (7, 2), (7, 1), (6, 1), (6, 0), (6, 9), (5, 9), (4, 9)]
user1502040
Aug 15, 2023 21:58
I don't think this puzzle is solvable (although I passed the check on Penpa). I have some cells with multiple shortest paths between them.
 

 Mathematics

Associated with Math.SE; for both general discussion & math qu...
5
37
user1502040
Dec 19, 2020 09:18
@copper.hat Maybe I'm being stupid but I don't see it. Do you have an algorithm in mind?
user1502040
Dec 19, 2020 04:52
*equally sized
user1502040
Dec 19, 2020 04:50
Say I have 2 equal sets of colored points, and I want to pair them up while minimizing the number of unique edges, where 2 edges are considered equal if they connect the same colors. Is this a hard problem?
 

 Ten fold

CrossValidated's general room for gossip, grumbles, and idle c...
user1502040
Jan 18, 2019 14:04
And what if some estimates are deterministic (y_std=0)? Then weighted least-squares would blow up.
user1502040
Jan 18, 2019 14:01
If I have a regression problem (e.g. with a neural network), where each y has an estimated uncertainty, does anyone have any idea what loss function I should use to learn the mapping from x -> (y_mean, y_std)? Weighted least squares with weights given by 1/variance seems reasonable for learning the mean, but I'm not sure about how to learn the variance.
 

 Ask Ubuntu General Room

Normally: General discussion around Ask Ubuntu, Ubuntu & offic...
3
user1502040
May 27, 2018 20:57
@Fabby 18.04
user1502040
May 27, 2018 20:56
Does anyone know how to get the tilde character on the UK Dvorak layout? It's shown as a second alternate key, but I've tried all the obvious combinations (ctrl, alt, shift, etc.) to no avail.
 

 Discussion on question by Challenger5…

Imported from a comment discussion on codegolf.stackexchange.c...
user1502040
Jun 8, 2017 14:10
@Challenger5 Earliest wins.
user1502040
Jun 8, 2017 14:10
If someone posts a clever answer, then it should be fairly trivial to generate a shorter answer with the same n by e.g. taking the maximum run-time of the first answer and eliminating any programs which run longer. Perhaps you should instead use priority as a tie-breaker.
user1502040
Jun 8, 2017 14:10
Only having 400 bytes available makes it hard to do anything interesting in a non-golfing language.
 

 The Nineteenth Byte

The Nineteenth Byte: General discussion for codegolf.stackexc...
9
1
user1502040
May 26, 2017 23:13
@Mego Don't worry, I asked Dennis
user1502040
May 26, 2017 21:57
ok, Jelly then.
user1502040
May 26, 2017 21:56
Is anyone here familiar with jelly?
 

 Jelly

Discussion of the Jelly programming language. (github.com/Denn...
user1502040
May 26, 2017 22:19
ok, thank you
user1502040
May 26, 2017 22:16
It's just an example
user1502040
May 26, 2017 22:15
Assume they have the same number of digits
user1502040
May 26, 2017 22:08
how would you e.g. convert 4 and 7 to binary and multiply the results?
user1502040
May 26, 2017 22:06
between them?
user1502040
May 26, 2017 22:05
how do you multiply two lists elementwise?
user1502040
May 26, 2017 21:59
Hey @Dennis can you give me please help me out with a simple question?
 

 Discussion on question by quintopia: …

Imported from a comment discussion on codegolf.stackexchange.c...
user1502040
Apr 9, 2017 04:21
I found a bug: If you double-cross then it is possible for bankid = self.guardbribes.pop() to raise the exception IndexError: pop from empty list
user1502040
Apr 9, 2017 04:21
@quintopia Can you elaborate on how the tournament will be run? Will each match be all-against-all? Will all of your example programs play?
user1502040
Apr 9, 2017 04:21
It would be much faster to keep the bot programs running continuously and pass arguments to stdin. This would also make it possible to preserve state between rounds.
user1502040
Apr 9, 2017 04:21
@devRicher Too late. I'll delete the comments when the mistakes are fixed.