Search found 403 matches

by benneh
Mon Jun 13, 2016 10:38 am UTC
Forum: Mathematics
Topic: Completions, Cauchy sequences, and countability
Replies: 7
Views: 3192

Re: Completions, Cauchy sequences, and countability

Maybe I'm misinterpreting your dissatisfaction, but isn't Cantor's theorem also a diagonalisation argument? If you identify a subset of S with its characteristic function S -> {0, 1}, then it's probably slightly clearer. Given an injective function f: S -> P(S), you can lay out all of the characteri...
by benneh
Sat Oct 24, 2015 11:03 am UTC
Forum: Mathematics
Topic: The beginning of my new calculation
Replies: 3
Views: 2001

Re: The beginning of my new calculation

If the blue cylinder is at at angle, then things get a bit more complicated. Let's say the axis of the green cylinder is the x-axis (i.e. in the direction of (1, 0, 0)) and its radius is r_g, and the axis of the blue cylinder is half way between the x-axis and the y-axis (i.e. in the direction of (1...
by benneh
Fri Oct 23, 2015 11:39 am UTC
Forum: Mathematics
Topic: The beginning of my new calculation
Replies: 3
Views: 2001

Re: The beginning of my new calculation

I'll give it a go. Let's say the axis of the green cylinder is the x-axis and its radius is r_x, and the axis of the blue cylinder is the y-axis and its radius is r_y. Then the equation for the surface of the green and blue cylinders, respectively, are: y^2 + z^2 = r_x^2 x^2 + z^2 = r_y^2 We want to...
by benneh
Tue Aug 25, 2015 7:25 pm UTC
Forum: Computer Science
Topic: MonadTransformer is just a hacky Traversable, right?
Replies: 3
Views: 5275

Re: MonadTransformer is just a hacky Traversable, right?

MonadTransformer is equivalent to the Compose functor; it wraps two monads up into a single one. That's not always the case. For example, the StateT monad transformer has the following definition: newtype StateT s m a = StateT { runStateT :: s -> m (a,s) } Thus "StateT s m a" is not the s...
by benneh
Mon Aug 24, 2015 12:40 pm UTC
Forum: Computer Science
Topic: MonadTransformer is just a hacky Traversable, right?
Replies: 3
Views: 5275

Re: MonadTransformer is just a hacky Traversable, right?

A monad is a thing which takes a type and gives you another type. So, using your notation, if "value" is a type and "B" is a monad, then "B<value>" is also a type. A monad transformer, however, is something entirely different. A monad transformer takes a monad and gives...
by benneh
Thu Jun 25, 2015 2:51 pm UTC
Forum: Computer Science
Topic: Deliberately bad algorithms
Replies: 120
Views: 42810

Re: Deliberately bad algorithms

Strange. I'm getting merely n! from that: Let S(n) be the cost of sorting n elements. Let S(n,m) be the cost where the first element is m away from the right place. S(n) <= S(n, n-1) S(1) = 1 S(n,0) <= 1 + 2S(n-1) (the case where head(list)<=min(tail(list))) S(n,k) <= 1 + S(n-1) + S(n, k-1) (otherw...
by benneh
Sat Jun 06, 2015 5:17 pm UTC
Forum: Computer Science
Topic: Deliberately bad algorithms
Replies: 120
Views: 42810

Re: Deliberately bad algorithms

hotaru wrote:speaking of things that GHC doesn't optimize much at all...

Code: Select all

loeb = fix (fmap . flip id =<<)
What is this supposed to do?
by benneh
Thu Jun 04, 2015 7:07 pm UTC
Forum: Computer Science
Topic: Deliberately bad algorithms
Replies: 120
Views: 42810

Re: Deliberately bad algorithms

You're evil. Then again, real-life Haskell will optimize the shit out of that line. The only inefficiency left is that it checks for factors larger than √n. Thank you :). My tests indicate that GHC doesn't optimise it much at all, though. I wrote a quick program to print out a list of prime numbers...
by benneh
Thu Jun 04, 2015 5:15 pm UTC
Forum: Computer Science
Topic: Deliberately bad algorithms
Replies: 120
Views: 42810

Re: Deliberately bad algorithms

Well, in mine the "n"s aren't quite measuring the same thing... so it's O(k'^n) loops of the main loop where k' is the range of the list (max minus min) and n is the length. Except complexities are usually given in terms of the length, not just the number of values, so k'=2 k (ie max minu...
by benneh
Thu Jun 04, 2015 8:42 am UTC
Forum: Computer Science
Topic: Deliberately bad algorithms
Replies: 120
Views: 42810

Re: Deliberately bad algorithms

For anyone confused by my 'stupider sort' algorithm, it is essentially just this: stupiderSort list: for perm in permutations(list): if perm is sorted: return perm I was originally going for something O(n^n), by doing something similar to phlip. After seeing phlip's solution, I've come up with this,...
by benneh
Wed Jun 03, 2015 5:46 pm UTC
Forum: Computer Science
Topic: Deliberately bad algorithms
Replies: 120
Views: 42810

Re: Deliberately bad algorithms

There's the obvious: fib 0 = 0 fib 1 = 1 fib n = fib (n-1) + fib (n-2) Or, another (slightly less) stupid sort: sort (a:as) = if isSorted as' then as' else sort (as ++ [a]) where as' = a : sort as sort [] = [] EDIT: Actually, I think this is O(n!). In which case, I name this algorithm 'stupider sort'.
by benneh
Fri Jul 25, 2014 8:46 pm UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (And we have a winner!)

So, any interest in another round?
by benneh
Wed Jul 23, 2014 2:06 pm UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (It just keeps on going!)

Oh, haha! I guess I overdid the teasing... Benneh, the game is over! You can open all spoilers now! Oops :P. Congratulations faubiguy! Why is everybody spoilering their post-game talk? I came so close to taking out Vytron's princess on turn 13. I definitely like the princesses being in the game; it...
by benneh
Mon Jul 21, 2014 7:57 pm UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (It just keeps on going!)

benneh's moves:
Spoiler:
F1: jump down-right
L1: attack down-left
W1: move down-right
W2: move up-right
7: move down-right
8: move down-right
P1: move down-left
P2: defend down-left
by benneh
Sun Jul 20, 2014 6:58 pm UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Game Over!)

benneh's moves:
Spoiler:
F1: explore down-right
L1: move down-right
W1: move up-right
W2: push down-right
7: move up
8: attack down-right
P1: move down-left
P2: move down-left
by benneh
Fri Jul 18, 2014 11:59 am UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Game Over!)

benneh's moves:
Spoiler:
F1: explore down-right
L1: move up-left
W1: move down-left
W2: move up-right
3: attack up-right
7: move up
8: attack up-right
P1: send down-left
P2: receive down-left
by benneh
Wed Jul 16, 2014 12:17 pm UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Game Over!)

benneh's moves:
Spoiler:
F1: explore up
L1: move up-right
W1: move up-left
W2: push up-right
3: move up-right
7: move up-right
8: move up-left
P1: move up-right
P2: attack up-left
by benneh
Mon Jul 14, 2014 5:15 pm UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Game Over!)

I should announce that my backup portable wormhole operator was hex 0.

benneh's moves:
Spoiler:
F1: explore up
L1: move down-right
W1: move up-right
W2: push up-left
1: grab up
3: move down-right
7: move up-right
8: move up
P1: move down-right
p: move up-right
T1: attack up
by benneh
Sat Jul 12, 2014 1:23 am UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

benneh's moves:
Spoiler:
F1: explore up-right
L1: grab up-right
W1: push down-right
W2: push up-left
0: move up-right
1: attack down
3: attack up
7: move up-right
8: move up-right
P1: send down-right
P2: receive down-left
T1: attack up-left
t2: move up-right
by benneh
Thu Jul 10, 2014 1:33 pm UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

I can confirm that my princess is alive. As is my backup portable wormhole operator, and it looks as if I'll require his services quite soon. benneh's moves: F1: explore up-right L1: grab up-right W1: push down-right W2: push up-left 0: move up-right 1: attack down 3: attack up 7: move up-right 8: m...
by benneh
Tue Jul 08, 2014 11:44 am UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

benneh's moves:
Spoiler:
F1: jump up-right
L1: move down-right
W1: attack up-left
W2: push up-left
0: attack up-right
1: attack down-right
2: grab up
3: move down-right
7: attack down-right
8: attack down
P1: move down-right
P2: move down
T1: defend down-right
t2: attack down-right
by benneh
Fri Jul 04, 2014 4:56 pm UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

benneh's moves: F2: jump up-right L1: attack down-left W1: attack up-left W2: push up-left 0: attack up 1: grab up-left 2: move up-right 3: move up-right 7: attack down-left 8: attack up P1: send down-left P2: receive up-right T1: move up-right t2: attack down-right EDIT: To explain what's going on:...
by benneh
Fri Jul 04, 2014 3:38 pm UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

I'm having connectivity issues at the moment; feel free to skip my actions until it's resolved.
by benneh
Thu Jul 03, 2014 6:09 pm UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

I can't post anything :(
by benneh
Tue Jul 01, 2014 6:39 am UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

benneh's moves:
Spoiler:
F1: jump up
F2: attack down-left
L1: attack up-right
W1: move up-left
W2: push up-right
0: attack up
1: move up-right
2: move down-right
3: move down-right
7: move up-right
8: move down-right
P1: grab down
P2: move up-right
T1: defend up
t2: move up-right
by benneh
Sat Jun 28, 2014 5:00 pm UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

Vytron wrote:Okay, so move order stays. Will try to get some rule that rules can be changed every 10 moves so changing them part-way is not inconsistent with the rules.

Hexassault-Nomic crossover! :D
by benneh
Sat Jun 28, 2014 12:24 pm UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

Well, looks like we have a tie decision, since patzer agreed with me to change the order part-way through I think benneh has the final decision about if we do it or not. I think I'm going to have to agree with faubiguy; while I do prefer having attacking happen before moving, it seems like a bad id...
by benneh
Fri Jun 27, 2014 1:56 pm UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

And so, faubiguy will live on as the only player that managed to teleport a piece via a Wormhole Portal Operator to backstab :mrgreen: That doesn't have to be the case. We could use this order: Ninja Grab Ninja Move Ninja Attack Frog Jump Grab (for non-ninjas) Frog Defend Long-ranged Attack Defend ...
by benneh
Fri Jun 27, 2014 7:50 am UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

Having moving happen before attacking is really throwing me; it makes it too difficult to actually kill anything. benneh's moves: F1: attack down-left F2: jump up-left L1: attack up-left W1: grab up-right W2: push up-right 0: move up 1: attack down-left 2: move up-left 3: move down-left 5: attack up...
by benneh
Wed Jun 25, 2014 8:03 am UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

OK, thanks.

benneh's moves:
Spoiler:
F1: jump up-right
F2: attack up-left
L1: move up-right
W1: move down-right
W2: push up-left
0: attack up
1: move down-right
2: move up
3: grab up-right
5: grab up
6: move up-right
7: move up
8: move up
P1: send down-left
P2: receive up
T1: attack up
t2: move up-right
by benneh
Tue Jun 24, 2014 4:00 pm UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

A push, followed by a teleport, followed by a stabbing? Nicely done.

I'm not entirely sure what's happened in my spawn area. How did Patzer's 3 end up where it did?
by benneh
Sat Jun 21, 2014 11:16 am UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

benneh's moves:
Spoiler:
F1: jump down
F2: explore down-right
L1: attack down-right
W1: move up-right
W2: push up-right
0: move up
1: move down-left
2: move up-right
3: attack up-right
5: attack up
6: move up
7: grab up-right
8: move up
P1: move up-right
P2: move up
T1: move up-right
t2: move up-left
by benneh
Sat Jun 21, 2014 8:05 am UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

Shouldn't my 9 have grabbed faubiguy's N1, pulling into its own spot as it died, and allowing it to be killed by my L1?
by benneh
Tue Jun 17, 2014 7:57 am UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

benneh's moves: N1: attack down F1: jump down F2: jump up-left L1: attack up-right 0: move down-right 1: move down-right 2: grab down 3: move down-right 5: grab up 6: move up-right 7: move up 8: grab down 9: grab down-right W1: move up-left W2: move down-right P1: move down-left P2: move up-right T1...
by benneh
Fri Jun 13, 2014 8:21 pm UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

benneh's moves: N1: move down-right F1: move down F2: move up-left L1: move down-right 0: grab down-left 1: grab down 2: move down-left 3: grab down-left 5: attack up-left 6: move up-left 7: move up-right 8: move down-left 9: move up-right P1: send down-right P2: receive down W1: push down W2: push ...
by benneh
Fri Jun 13, 2014 8:02 am UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

Damn, I completely misplayed that business with my and vytron's long-ranged attackers.

Shouldn't faubiguy's 7 have been killed by my 2? Also my W2 should have moved down-left.
by benneh
Tue Jun 10, 2014 8:01 pm UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

I don't think such portals are necessary as frogs currently have no reason to want to dig away from the board indefinitely, but they seem an interesting addition to the game. I don't mind whether they exist or not. I agree. I'm the only one digging at the moment, and I have no intention of just wan...
by benneh
Tue Jun 10, 2014 7:40 am UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

benneh's moves: N1: attack down-right F1: jump down-right F2: explore down-left L1: move down-right L2: long-range attack down 0: move up-right 1: move down-right 2: attack down 3: grab down-right 5: move up 6: move down-right 7: attack down-right 8: move down-right 9: move down-right W1: push down-...
by benneh
Sun Jun 08, 2014 6:57 pm UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

benneh's moves: N1: grab up-left N2: attack down F1: jump down-right F2: explore down-left 1: move down-right 2: move down 3: move up-right 5: attack down 6: move down 7: move down 8: move down 9: move up-right L1: move down-right L2: grab up W2: push down W1: push down P1: move up-right P2: move do...
by benneh
Sun Jun 08, 2014 7:14 am UTC
Forum: Forum Games
Topic: HEXASSAULT (And we have a winner!)
Replies: 183
Views: 19490

Re: HEXASSAULT (Now starting!)

benneh's moves: N1: move down-right N2: move down-right F2: move down-left 0: move up-right 1: move up-right 2: move down-right 3: move up-right 4: attack up-right 5: move down-right 6: move down 7: move down 8: move down 9: move down-right L1: move down-right L2: move up-right W1: push up-right W2:...

Go to advanced search