|
|||||||||
|
|||||||||
| |||||||||
|
|||||||||
|
|||||||||
| |||||||||
|
|
|
| ||||||||||||||||||||||||||||||||
 |
|
|
«
Previous Thread
|
Next Thread
»
|
Thread Tools | Search this Thread | Rate Thread | Display Modes |
Codewalkers Forums Sponsor:
|
|
|
|
#1
May 23rd, 2002, 07:18 PM
|
|||
|
|||
|
new test deck.txt
This one is always solvable
 8C 7C 7H 4H 5C 6D 7S 6C 6H 3H 4C 5D 6S 5H 2H 3C 4D 5S 1H 2C 3D 4S 1C 2D 3S 1D 2S 1S JH QH KH 8H 9H 10H JC QC KC KD 9C 10C 10D JD QD 7D 8D 9D JS QS KS 8S 9S 10S
|
|
#2
May 28th, 2002, 12:35 PM
|
|||
|
|||
|
RE: new test deck.txt
I was really worried about not solving this one until I realised that the stock pile is in reverse order. In that case it's easily soluble. But otherwise it's not. (I get 490 in 60ms processor time, dropping out because stock passes become ineffective.) So if you *can* solve this one, one of us has a bug.
I've put up a whole bunch of decks - mostly soluble ones - on http://dave.cridland.net/.
|
|
#3
May 28th, 2002, 01:54 PM
|
|||
|
|||
|
RE: new test deck.txt
Well that does explain why I cant solve some
of the others. But this deck is special, because it should allow for a very quick solve. (all cards are arranged in a way there is always a good move) (first the entire tableau is moved to the foundation, then the next 3 cards from stock, then the next. etc.) this should yield the results I meant to provide: 8C 7C 7H 4H 5C 6D 7S 6C 6H 3H 4C 5D 6S 5H 2H 3C 4D 5S 1H 2C 3D 4S 1C 2D 3S 1D 2S 1S 10S 9S 8S KS QS JS 9D 8D 7D QD JD 10D 10C 9C KD KC QC JC 10H 9H 8H KH QH JH
|
|
#4
May 28th, 2002, 04:33 PM
|
|||
|
|||
|
RE: new test deck.txt
Yeah, that's what I thought.
But you can move cards from the stock to the tableau, and score more. I got 675 in 50ms, but I'm reasonably sure different algorithms could score more than that.
|
|
#5
May 29th, 2002, 08:41 PM
|
|||
|
|||
|
RE: new test deck.txt
so, how it is - can i play again and again (look for all combinations) and in the end show only combination, which got most points? imho it's cheating.
|
|
#6
May 30th, 2002, 12:30 PM
|
|||
|
|||
|
RE: new test deck.txt
Playing multiple algorithms has been declared not cheating by Matt. There's some debate about whether you're allowed to remember the path through the decision tree, though. IMHO, that'd be cheating, but others disagree.
Personally, I'm trying to find a general algorithm which gets the highest points I can on random decks, while keeping the speed low. But that'd just me.
|
|
| Viewing: Codewalkers Forums > PHP Contests > Older Contests > new test deck.txt |
| Thread Tools | Search this Thread |
| Display Modes | Rate This Thread |
|
|
|
|
|
|
 |
|
|
Del.icio.us
Digg
Google
Spurl
Blink
Furl
Simpy
Y! MyWeb
Linear Mode
