Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with python
Search options not deleted
user 80470
This challenge is related to the Python language. Note that challenges that require the answers to be in a specific language are generally discouraged.
3
votes
White Elephant Exchange
Odd Todd
class OddTodd(WhiteElephantBot):
def take_turn(self, players, presents, just_stole):
targets = self.steal_targets(presents, just_stole)
# if none to steal, pick present …
- 81
2
votes
Noisy Iterated Prisoner's Dilemma
Buckets
def buckets(m, t, s):
if len(m) <= 5:
return 'c'
if len(m) >= 250:
return 'd'
d_pct = t[-20:].count('d')/len(t[-20:])
if random.random() > (2 * d_pct - 0.5):
…
- 81