Mercurial > repo
view paste/paste.27897 @ 11317:16da968350f1
<zzo38> slashlearn cricket//Cricket is one team is in and one team is out, and the team who are out try to get the team who is in to be out, and then the team who was previously out can be in. Whoever earn more points wins, unless you run out of time, in which case nobody wins.
author | HackBot |
---|---|
date | Sun, 14 Jan 2018 03:44:32 +0000 |
parents | dbdaec9c97fd |
children |
line wrap: on
line source
2009-05-25.txt:23:09:58: <oerjan> ais523: i noticed a possible error in the eodermdrome spec 2009-05-30.txt:05:24:13: <oerjan> Gracenotes: been reading my eodermdrome drawings? 2010-01-12.txt:02:39:38: <oerjan> (that one is untested, btw, since there isn't afaik any eodermdrome interpreter yet 2010-03-12.txt:22:59:44: <oerjan> cpressey: have you looked at eodermdrome? 2010-04-20.txt:00:38:01: <oerjan> and eodermdrome can _look_ like that, i think 2011-07-23.txt:08:57:07: <oerjan> clearly we need to get someone vietnamese to write the eodermdrome C interpreter 2011-11-30.txt:19:43:19: <oerjan> elliott_: wikipedia as an eodermdrome program. discuss. 2012-09-29.txt:21:22:19: <oerjan> i already proved eodermdrome tc, thank you very much 2012-12-08.txt:23:44:57: <oerjan> i note there has been an eodermdrome interpreter, and there's a proof eodermdrome is tc, but they didn't exist simultaneously so no one's ever got to test it. 2013-02-11.txt:22:06:39: <oerjan> <Phantom_Hoover> Don't think you have to use duplication for it, which is the trickiest thing in eodermdrome. <-- hm ideally you'd want [] to actually have a real cyclic path representation 2013-02-11.txt:22:08:36: <oerjan> i think the main difficulties with doing this in eodermdrome are (1) the limited number of letters forcing you to look at only small parts of the graph at a time - my BCT interpreter almost reached the limit although ais523 had a hunch it could be made to use less. (2) no implementation to actually test stuff in, which admittedly didn't stop me from doing BCT. 2013-02-11.txt:22:10:55: <oerjan> `log <oerjan.*[^o]d.*rmdr.*m.* 2013-02-11.txt:22:11:23: <HackEgo> 2013-02-11.txt:22:08:36: <oerjan> i think the main difficulties with doing this in eodermdrome are (1) the limited number of letters forcing you to look at only small parts of the graph at a time - my BCT interpreter almost reached the limit although ais523 had a hunch it could be made to use less. (2) no implementation to actually test stuff in, w 2013-02-11.txt:22:12:00: <oerjan> `log <oerjan.*[^o]d..?.?rmdr.?.?m 2013-02-11.txt:22:12:08: <HackEgo> 2013-02-11.txt:22:10:55: <oerjan> `log <oerjan.*[^o]d.*rmdr.*m.* 2013-02-11.txt:22:12:17: <oerjan> `pastlog <oerjan.*[^o]d..?.?rmdr.?.?m 2013-02-11.txt:22:12:45: <oerjan> `pastlog <oerjan.*[^o]d..?.?.?rmdr..?.?.?m 2013-02-11.txt:22:13:22: <oerjan> `pastlog <oerjan.*d.?.?.?[^e]rmdr..?.?.?m 2013-02-11.txt:22:15:16: <oerjan> `pastlog <oerjan.*d.?.?.?.?[^e]rmdr..?.?.?.?m 2013-02-11.txt:22:16:21: <oerjan> `pastelogs <oerjan.*[^o]d.*rmdr.*m.*