Not logged inRybka Chess Community Forum
Up Topic The Rybka Lounge / Computer Chess / Fibonaccci 1.1
- - By Vegan (****) Date 2010-03-07 18:05 Edited 2010-03-07 18:20
I have revised the program to no longer show output to the terminal Window but rather now the program is focused on crushing RAM to the wall.

The new version feeds std::vector with the results to simulate a RAM hungry program like chess.

http://contract-developer.dyndns.biz

Its in the forum under benchmarking, 64-bit only, again
Parent - - By Sesse (****) Date 2010-03-07 19:00
Perhaps you should consider posting this under something else than “Computer chess”. :-)

/* Steinar */
Parent - - By Vegan (****) Date 2010-03-07 19:03
This version works memory very close to TBGEN. TBGEN uses a vector itself to manage the sea of positions that each have to be searched.
Parent - - By dragon49 (****) Date 2010-03-10 03:18
I7-920 2.67 6 GHZ 1600 MHZ Corsair Dominator Ram Geoforce GTX 250

Terminal Performance 51.516 seconds

RAM Performance 4.578 seconds
Parent - - By Vegan (****) Date 2010-03-10 04:00
There is a new version available, thanks. I have now got 4 tests with one sequence. Gives me more respect for Fibonacci.
Parent - - By AndrewWalker (**) Date 2010-03-10 08:02
You might be able to have some fun playing/experimenting with recursion :-)

For example F(10) = F(9)+F(8)
                         = F(8)+F(7)+F(7)+F(6)
                          etc....

Just start with low values!!

Andrew
Parent - - By Sesse (****) Date 2010-03-10 16:34
That's what he's doing. Otherwise it couldn't possibly be so slow.

/* Steinar */
Parent - By Vegan (****) Date 2010-03-10 21:15
I am not using a recursive loop at present, just an iterative one.
Up Topic The Rybka Lounge / Computer Chess / Fibonaccci 1.1

Powered by mwForum 2.27.4 © 1999-2012 Markus Wichitill