Why don't you guys use Chess Engine Cloud http://www.engine-cloud.com/
I've never tried it myself. Has anyone here tried it and what do you think?
Search found 13 matches
- Thu Jun 01, 2017 4:20 am
- Forum: Engines, GUIs, Books and Platforms
- Topic: Remote UCI engines and port forwarding
- Replies: 18
- Views: 30953
- Sat Jan 07, 2017 10:43 pm
- Forum: Engines, GUIs, Books and Platforms
- Topic: Missing chess software features you want most?
- Replies: 2
- Views: 4561
Missing chess software features you want most?
What are some of the missing chess software features that you guys wished existed and would be willing to pay for. I'm looking for a small interesting project to work on in chess.
- Sun Oct 07, 2012 4:48 am
- Forum: Programming and Technical Discussions
- Topic: Houdini and 100% cpu utilization
- Replies: 3
- Views: 2493
Houdini and 100% cpu utilization
I've noticed that Houdini achieves 100% cpu utilization across all my cores. And other engines such as Rybka and Stockfish don't. What is holding back Rybka and Stockfish from achieving 100% cpu utilization?
- Sat Sep 29, 2012 12:44 am
- Forum: Programming and Technical Discussions
- Topic: Aquarium IDEA, repetitions, and minimax over cycles
- Replies: 8
- Views: 7951
Re: Aquarium IDEA, repetitions, and minimax over cycles
Thomas Lincke's PhD thesis Exploring the Computational Limits of Large Exhaustive Search Problems has a section on it (section 4.3).
That thesis is an amazing find though I'm saddened to see that the thesis was written in 2002 which is before the paper by Kishimoto and Muller (2004) http://webdocs ...
That thesis is an amazing find though I'm saddened to see that the thesis was written in 2002 which is before the paper by Kishimoto and Muller (2004) http://webdocs ...
- Sat Sep 22, 2012 5:53 am
- Forum: Programming and Technical Discussions
- Topic: Aquarium IDEA, repetitions, and minimax over cycles
- Replies: 8
- Views: 7951
Re: Aquarium IDEA, repetitions, and minimax over cycles
Thomas Lincke's PhD thesis Exploring the Computational Limits of Large Exhaustive Search Problems has a section on it (section 4.3).
That thesis is an amazing find though I'm saddened to see that the thesis was written in 2002 which is before the paper by Kishimoto and Muller (2004) http ...
That thesis is an amazing find though I'm saddened to see that the thesis was written in 2002 which is before the paper by Kishimoto and Muller (2004) http ...
- Thu Sep 20, 2012 6:27 am
- Forum: Programming and Technical Discussions
- Topic: Graph History Interaction Problem
- Replies: 1
- Views: 1325
Re: Graph History Interaction Problem
The previous pseudocode is for implementing extending the graph by a move. And on a side note on further reflection I realize it doesn't handle for example an drawn endgame consisting of rook king pawn vs rook king. It would exhaust all the positions but if the approximate evaluation passed in was ...
- Thu Sep 20, 2012 5:40 am
- Forum: Programming and Technical Discussions
- Topic: Graph History Interaction Problem
- Replies: 1
- Views: 1325
Graph History Interaction Problem
I am trying to understand the graph history interaction problem described in this paper by Kishimoto and Mueller.
http://webdocs.cs.ualberta.ca/~mmueller/ps/kishimoto-mueller-infsci-ghi.pdf
I see that the problem has already been discussed but I couldn't follow their discussion.
http://open ...
http://webdocs.cs.ualberta.ca/~mmueller/ps/kishimoto-mueller-infsci-ghi.pdf
I see that the problem has already been discussed but I couldn't follow their discussion.
http://open ...
- Thu Sep 20, 2012 2:02 am
- Forum: Programming and Technical Discussions
- Topic: How do chess servers store ongoing games?
- Replies: 2
- Views: 1875
How do chess servers store ongoing games?
Do chess servers typically keep games in progress as something in a SQL database or do they store games all in memory?
- Thu Sep 20, 2012 1:45 am
- Forum: Programming and Technical Discussions
- Topic: How to make a scalable clock implementation
- Replies: 3
- Views: 1518
Re: How to make a scalable clock implementation
How do chess servers keep track of time for all the games being played. There could potentially be many games where the clock runs down to 0 for one side and the server needs to check for that. A direct approach such as trying to check for that condition for all the games as fast as possible seems ...
- Wed Sep 19, 2012 6:38 am
- Forum: Programming and Technical Discussions
- Topic: How to make a scalable clock implementation
- Replies: 3
- Views: 1518
How to make a scalable clock implementation
How do chess servers keep track of time for all the games being played. There could potentially be many games where the clock runs down to 0 for one side and the server needs to check for that. A direct approach such as trying to check for that condition for all the games as fast as possible seems ...