view paste/paste.12192 @ 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 f5ccf6a4ad2a
children
line wrap: on
line source

2005-05-15.txt:13:39:42: <pgimeno> http://www.chiark.greenend.org.uk/~sgtatham/infinity.html  <- pretty much like that I think
2005-08-04.txt:19:45:35: <mtve> lament: it was here afair, and i'm sure you've seen this   http://www.chiark.greenend.org.uk/~sgtatham/infinity.html
2006-03-17.txt:16:38:26: <pgimeno> hum, Simon Tatham claims that http://xn13.com/ is Ben Olmstead's homepage... http://www.chiark.greenend.org.uk/~sgtatham/puzzles/doc/inertia.html
2007-01-16.txt:12:58:43: <SimonRC> http://www.chiark.greenend.org.uk/~sgtatham/coroutines.html
2007-01-16.txt:13:42:13: <pgimeno> Simon Tatham
2007-01-16.txt:13:53:59: <pgimeno> one of the puzzles in S.Tatham's collction
2007-07-14.txt:21:26:24: <GregorR-L> http://www.chiark.greenend.org.uk/~sgtatham/infinity.html
2008-01-04.txt:20:19:54: <pikhq> http://www.chiark.greenend.org.uk/~sgtatham/infinity.html
2008-03-10.txt:01:34:32: <ehird> Infinity machine: http://www.chiark.greenend.org.uk/~sgtatham/infinity.html
2008-03-10.txt:01:35:02: <ehird> If endeavour was written, I'd pronounce that as '@what infinity machine=http://www.chiark.greenend.org.uk/~sgtatham/infinity.html'
2008-08-02.txt:00:27:33: <pikhq> http://www.chiark.greenend.org.uk/~sgtatham/infinity.html
2008-08-02.txt:01:05:52: <pikhq> http://www.chiark.greenend.org.uk/~sgtatham/aliases.html
2009-02-07.txt:18:42:02: <oerjan> *tatham
2009-04-23.txt:21:06:46: <oerjan> moreover i think i recognize those files as something AVG removed before, from the old version i had of simon tatham's puzzles
2009-06-30.txt:15:53:07: <Deewiant> Also "mines" at http://www.chiark.greenend.org.uk/~sgtatham/puzzles/ claims to do it
2009-09-18.txt:22:27:14: <oerjan> (notation from simon tatham's puzzle help)
2009-09-18.txt:22:28:16: <oerjan> (sudoku is called "solo" in the tatham puzzle collection, btw)
2009-09-20.txt:01:17:21: <oerjan> ehird: tatham's killer sudoku got a lot easier after i had that realization before the quote, now i've solved everyone i tried (except possibly one i interrupted), while before i'd only managed a single one afair
2010-01-06.txt:21:14:39: <oerjan> dammit i was typing with focus into tatham's puzzles
2010-03-12.txt:20:23:05: <oerjan> which reminds me of the main thing i dislike about simon tatham's puzzle collection
2010-03-25.txt:14:51:11: <oerjan> also the thing i previously mentioned about simon tatham puzzles's q command fits right in :(
2010-07-05.txt:02:51:16: <pikhq> alise: http://www.chiark.greenend.org.uk/~sgtatham/coroutines.html
2010-07-06.txt:20:51:15: <pikhq> http://www.chiark.greenend.org.uk/~sgtatham/coroutine.h
2010-09-12.txt:23:08:58: <fizzie> http://www.chiark.greenend.org.uk/~sgtatham/coroutines.html if you've never seen it.
2010-09-14.txt:23:18:26: <alise> http://www.chiark.greenend.org.uk/~sgtatham/algorithms/listsort.html
2010-09-14.txt:23:18:34: <alise> Computer Terminology question: How would you sort a linked list? using merge sort.http://www.chiark.greenend.org.uk/~sgtatham/algorithms/listsort.html.
2010-09-14.txt:23:20:30: <alise> http://www.chiark.greenend.org.uk/~sgtatham/enigma/
2010-09-19.txt:15:48:18: <alise> http://www.chiark.greenend.org.uk/~sgtatham/algorithms/listsort.html has a complete pseudocode mergesort that, though i haven't read it, seems to be optimised for doing it iteratively on a linked list
2010-12-14.txt:17:38:56: <elliott> oerjan: http://the.earth.li/~sgtatham/putty/latest/x86/putty.exe
2011-01-14.txt:15:41:13: <elliott> http://www.chiark.greenend.org.uk/~sgtatham/infinity.html
2011-02-20.txt:02:01:14: <elliott> oerjan: http://the.earth.li/~sgtatham/putty/latest/x86/putty.exe
2011-02-20.txt:02:01:23: <elliott> unless you used the installer: http://the.earth.li/~sgtatham/putty/latest/x86/putty-0.60-installer.exe
2011-07-16.txt:04:21:16: * oerjan has simon tatham's lightup in the other window
2011-08-14.txt:22:33:45: <oerjan> i've several times been annoyed when i accidentally typed an n or a q into simon tatham's puzzle windows
2012-01-19.txt:02:07:05: * oerjan has been playing tatham's lightup puzzle for months
2012-04-24.txt:12:13:58: <elliott> http://www.chiark.greenend.org.uk/~sgtatham/putty/
2012-07-07.txt:01:35:45: * soundnfury wonders if http://www.chiark.greenend.org.uk/~sgtatham/infinity.html might inspire any esolangs
2012-07-13.txt:22:16:59: * oerjan is having a bout of simon tatham's Loopy puzzle
2012-07-31.txt:21:10:54: <oerjan> come to think of it, it used to happen when i was solving a lot of simon tatham's puzzles before...
2013-06-21.txt:11:15:54: <oerjan> turns out asus's touchpads don't have very good drivers.  and that playing tatham's puzzles with them therefore sucks.
2013-07-05.txt:07:23:09: <oerjan> funny, simon tatham's "single" puzzle becomes easier with larger board, because there are too many clues...
2013-07-07.txt:07:51:12: <oerjan> in other news, simon tatham still hasn't fixed that thing where undo doesn't work across accidentally pressing n
2013-07-11.txt:09:01:28: <oerjan> oh, this simon tatham puzzle was made by ben olmstead
2013-07-11.txt:09:03:29: <mnoqy> is simon tatham a brand