Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number
 
PerlMonks  

Re: On Interviewing Candidates

by Jenda (Abbot)
on Aug 26, 2005 at 23:39 UTC ( #487065=note: print w/replies, xml ) Need Help??


in reply to On Interviewing Candidates
in thread Interview questions

I once implemented Minesweeper in Prolog and another time in Concurrent Clean. In both cases the minesweepers could optionally solve the easier cases for you. It was up to the level of "this square needs one more bomb, so these three squares may contain only one bomb so if that square needs two bombs, then the square over there must be a bomb, and the other will be in one of those two so this square is safe, ..." Shame I lost the code. I wonder though how much would it tell you about my understanding of objects ;-P

Jenda
XML sucks. Badly. SOAP on the other hand is the most powerfull vacuum pump ever invented.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://487065]
help
Chatterbox?
[choroba]: MCE
[karlgoethebier]: is about to reach nirvana tonight...
[Lady_Aleena]: It could have meant a "Miserably Cute Event" or "Man Crush Everyday". 8)
[Corion]: choroba: Re the one-shot thing, I also thought of bit vectors and/or indexes into one common array from the hashes, but that makes maintenance of all these indices a chorse
[Corion]: *core
[Corion]: ** chore
[Corion]: So I guess I will simply implement the linear scan first and wait with more fancy stuff until it becomes a problem
[karlgoethebier]: Lady_Aleena: ++ for "The Man Crusher Everyday"
[karlgoethebier]: this mad my day
[karlgoethebier]: no typo

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (13)
As of 2017-05-29 08:30 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?