Does anyone know where the source code for Yampa Arcade can be found? Googling "yampa arcade" turned up this http://www.cs.hmc.edu/courses/2006/spring/cs182-3/afrp/ but I was expecting to find it stand alone rather than as part of a lecture course. Thanks, Dominic.
Hi Dominic,
Does anyone know where the source code for Yampa Arcade can be found?
It's included with the (now very old) afrp-0.4 distribution available from www.haskell.org/yampa It's in the examples/SpaceInvaders directory. Hope that helps! All the best, /Henrik -- Henrik Nilsson School of Computer Science and Information Technology The University of Nottingham nhn@cs.nott.ac.uk This message has been checked for viruses but the contents of an attachment may still contain software viruses, which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation.
I'd greatly appreciate it if someone could provide a summary of the best times recently posted for Haskell Sudoku solvers so I can compare them with some experimental code I have. Since the Sudoku puzzle is incidental to the purpose of my code, I'd just like to find out whether or not my current code is working in the neighborhood of "the good stuff." Right now, easy puzzles go under in 4 or 5 seconds, evil puzzles range from about 12 seconds to just under 2 minutes on a 650 MHz Duron. Thanks, Murray Gross
I'm not sure if there is a comprehensive timing summay but here are some different approaches and code you can compile and run on your machine: http://haskell.org/haskellwiki/Sudoku In fact, if you run them all, you can share your numbers with us and we can add them to the Sudoku page. And of course you can check the archives for any threads about it (assuming you can get to each person's code somehow). Jared. On 7/9/06, Murray Gross <mgross21@verizon.net> wrote:
I'd greatly appreciate it if someone could provide a summary of the best times recently posted for Haskell Sudoku solvers so I can compare them with some experimental code I have.
Since the Sudoku puzzle is incidental to the purpose of my code, I'd just like to find out whether or not my current code is working in the neighborhood of "the good stuff." Right now, easy puzzles go under in 4 or 5 seconds, evil puzzles range from about 12 seconds to just under 2 minutes on a 650 MHz Duron.
Thanks,
Murray Gross
_______________________________________________ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell
-- http://www.updike.org/~jared/ reverse ")-:"
Murray Gross wrote:
I'd greatly appreciate it if someone could provide a summary of the best times recently posted for Haskell Sudoku solvers so I can compare them with some experimental code I have.
Since the Sudoku puzzle is incidental to the purpose of my code, I'd just like to find out whether or not my current code is working in the neighborhood of "the good stuff." Right now, easy puzzles go under in 4 or 5 seconds, evil puzzles range from about 12 seconds to just under 2 minutes on a 650 MHz Duron.
Thanks,
Murray Gross
I improved the speed and strength of my solver and it finishes the 36638 puzzles of http://www.csse.uwa.edu.au/~gordon/sudoku17 in 3885 seconds. It can solve all but 164 without guessing, and averages greater 9 puzzles per second on a 1.33 GHz PPC Mac OS X laptop using ghc-6.4.2 Most of those puzzles (about 91.5%) are particularly simple and go especially quickly. The next 8.1% of the puzzles use more expensive deductive methods, and the remaining 0.4% do depth first guessing. -- Chris
On Sun, 9 Jul 2006, Chris Kuklewicz wrote:
I improved the speed and strength of my solver and it finishes the 36638 puzzles of http://www.csse.uwa.edu.au/~gordon/sudoku17 in 3885 seconds. It can solve all but 164 without guessing, and averages greater 9 puzzles per second on a 1.33 GHz PPC Mac OS X laptop using ghc-6.4.2
Most of those puzzles (about 91.5%) are particularly simple and go especially quickly. The next 8.1% of the puzzles use more expensive deductive methods, and the remaining 0.4% do depth first guessing.
Thanks, this is just the kind of number I was looking for. Given the differences in hardware and software, your code appears to be about 10 times as fast as what I am running now. Given that I have done no code tweaking, this tells me that my algorithms do quite nicely, even if the code is not setting any records, which puts my code right in the area that I was looking for. Once again, thanks. Murray Gross
Murray Gross wrote:
I'd greatly appreciate it if someone could provide a summary of the best times recently posted for Haskell Sudoku solvers so I can compare them with some experimental code I have.
Since the Sudoku puzzle is incidental to the purpose of my code, I'd just like to find out whether or not my current code is working in the neighborhood of "the good stuff." Right now, easy puzzles go under in 4 or 5 seconds, evil puzzles range from about 12 seconds to just under 2 minutes on a 650 MHz Duron.
Thanks,
Murray Gross
I have put my deductive solver on the wiki: http://haskell.org/haskellwiki/Sudoku#Very_Smart.2C_with_only_a_little_guess... source code: http://evenmere.org/~chrisk/chris-sudoku-deduce.tar.gz -- Chris
Henrik Nilsson wrote:
Hi Dominic,
Does anyone know where the source code for Yampa Arcade can be found?
It's included with the (now very old) afrp-0.4 distribution available from
www.haskell.org/yampa
It's in the examples/SpaceInvaders directory.
Hope that helps!
All the best,
/Henrik
Henrik, Thanks. I tried ghc --make Main.hs on the code from http://www.cs.hmc.edu/courses/2006/spring/cs182-3/afrp but got Compiling ObjectBehavior ( ./ObjectBehavior.hs, ./ObjectBehavior.o ) ./ObjectBehavior.hs:37:56: parse error on input `->' The code in examples/SpaceInvaders for ObjectBehavior.as is identical so I assume that won't compile either. Why .as? If anyone has got this working please let me know. I tried making www.haskell.org/yampa but got [dom@tility afrp-0.4]$ make make -C src make[1]: Entering directory `/home/dom/yampa/nilsson/afrp-0.4/src' ghc -c -fglasgow-exts -O -package lang -package concurrent -o AFRPUtilities.o AFRPUtilities.hs AFRPUtilities.hs:169:46: Ambiguous occurrence `>>^' It could refer to either `AFRPUtilities.>>^', defined at AFRPUtilities.hs:106:2 or `Control.Arrow.>>^', imported from AFRP at AFRPUtilities.hs:90:0-10 So it looks like the code has rotted a bit. I'm assuming the code from hmc is in better shape (as it seems to be in a Spring '06 directory and the compilation got a few modules further) and may have a go at seeing if I can get it to compile. Dominic.
On Tuesday 11 July 2006 07:56, Dominic Steinitz wrote:
I tried making www.haskell.org/yampa but got
[dom@tility afrp-0.4]$ make make -C src make[1]: Entering directory `/home/dom/yampa/nilsson/afrp-0.4/src' ghc -c -fglasgow-exts -O -package lang -package concurrent -o AFRPUtilities.o AFRPUtilities.hs
AFRPUtilities.hs:169:46: Ambiguous occurrence `>>^' It could refer to either `AFRPUtilities.>>^', defined at AFRPUtilities.hs:106:2 or `Control.Arrow.>>^', imported from AFRP at AFRPUtilities.hs:90:0-10
It's pretty straight forward to get it going, at least with GHC 6.4.1. From memory you'll get the ambiguous errors above for 4 functions in AFRPUtilities which are now in Control.Arrow and some problems with modules moving into the heirarchical module namespace. Perhaps IO and Random? Just delete the four arrow functions from AFRPUtilities and use the in-builts from Control.Arrow and import the hierarchical modules. Oh, and watch your tab size, there is a blend of spaces and tabs at the start of lines. Or I can send you a copy of the code I've got here. Daniel
participants (6)
-
Chris Kuklewicz -
Daniel McAllansmith -
Dominic Steinitz -
Henrik Nilsson -
Jared Updike -
Murray Gross