Sam Trenholme's webpage
This article was posted to the Usenet group alt.hackers in 1995; any technical information is probably outdated.

Re: Minewsweeper solver


Article: 7801 of alt.hackers
From: js10039@thor.cam.ac.uk (J. Sullivan)
Newsgroups: alt.hackers
Subject: Re: Minewsweeper solver
Date: 11 May 1995 18:54:12 GMT
Organization: University of Cambridge, England
Lines: 18
Approved: maybe
Message-ID: 3otmgk$m2m@lyra.csx.cam.ac.uk
NNTP-Posting-Host: hammer.thor.cam.ac.uk
Status: RO

Tony Finch <fanf2@thor.cam.ac.uk> wrote:
>J. Sullivan <js10039@thor.cam.ac.uk> wrote:
>>
>> ObHack:
>>
for(a[2]=0;a[2];a[a[2]]="0123456789abcdef"[(c>>(4*a[2]))&15])a[2]--;
>
>A rather complicated NOP.
>
>ObHack:
>
>for(8[a]=8;a[8];8[a][a]="0123456789abcdef"[c>>28-(a[8]<<2)&15])--a[8];

Yes, ok shadowy one, I broke it between writing it and posting it. I
still prefer:

for(a[2]=2;a[2];*(a+*(a+2))="0123456789abcdef"[c>>4*!a[2]&15])a[2]--;

John



Parent Parent Parent Parent

Back to index