Computer Chess Club Archives

Search

Terms

Messages

Subject: One Reply Extension

Author: Nobuhiro Yoshimura

Date: 18:31:13 02/20/99

I have a question for how other programmers are  implementing it.
When we use iterative-deeping and transposition table, it is very likely
to get a good move from a hash table.   Since we get the move without
calling a move-generator and start searching, I have no idea whether or
not the node has only one move.

How do you know ?
Do you call a special check routine in order to know the node has a sinlge move
when king in check?

Re: One Reply Extension Robert Hyatt 22:07:18 02/20/99
- Re: One Reply Extension Nobuhiro Yoshimura 15:48:16 02/21/99
  - Re: One Reply Extension Robert Hyatt 08:18:07 02/22/99
Re: One Reply Extension Pat King 19:23:08 02/20/99
- Re: One Reply Extension Bruce Moreland 19:59:30 02/20/99
  - Re: One Reply Extension Pat King 14:20:56 02/21/99
Re: One Reply Extension Will Singleton 19:03:33 02/20/99
- Re: One Reply Extension Nobuhiro Yoshimura 19:15:07 02/20/99
  - Re: One Reply Extension Will Singleton 20:44:15 02/20/99
Re: One Reply Extension James Long 18:55:21 02/20/99

This page took 0.01 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.