ChessUSA.com TalkChess.com
Hosted by Your Move Chess & Games
 
 FAQFAQ   SearchSearch   MemberlistMemberlist   UsergroupsUsergroups   RegisterRegister 
 ProfileProfile   Log in to check your private messagesLog in to check your private messages   Log inLog in 

Counting depth as a function of number of legal moves
Post new topic    TalkChess.com Forum Index -> Computer Chess Club: Programming and Technical Discussions Flat
View previous topic :: View next topic  
Author Message
Uri Blass



Joined: 08 Mar 2006
Posts: 6012
Location: Tel-Aviv Israel
PostPost subject: Re: Counting depth as a function of number of legal moves    Posted: Fri Mar 02, 2012 8:40 pm Reply to topic Reply with quote
zamar wrote:
Hi Pio,

As others have pointed out the idea is already well known.

However personally I think that the total number of moves in a position is not a good metric, because it stays pretty constant during the middle-game.

The more interesting metric IMO would be "the number of reasonable moves" / position. By a reasonable move I mean a move where evaluation doesn't drop more than say 30cp compared to the best move.
But the obvious problem with this approach is the huge additional computing cost, so... likely we are just better off by extending checks, singular moves and pawn endgames Smile


I do not think that it is a good metric and the problem is that a move that is 0.4 pawn weaker than the best move or even more than it may be the best move with deeper search so I cannot decide to prune it and I need to search it.

If you need to search a move then it makes the search more complex and I do not see the logic of ignoring it completely in calculating complexity.

Maybe you can consider it with smaller weight because you expect to waste less time on the search on it but you should count all moves(maybe not with the same weight).
Back to top
View user's profile Send private message
Display posts from previous:   
Subject Author Date/Time
Counting depth as a function of number of legal moves Pio Korinth Tue Feb 28, 2012 10:32 pm
      Re: Counting depth as a function of number of legal moves Daniel Shawul Wed Feb 29, 2012 5:26 am
      Re: Counting depth as a function of number of legal moves Heiner Marxen Wed Feb 29, 2012 7:39 pm
      Re: Counting depth as a function of number of legal moves H.G.Muller Wed Feb 29, 2012 8:52 pm
            Re: Counting depth as a function of number of legal moves Stefano Gemma Sun Aug 12, 2012 8:01 am
                  Re: Counting depth as a function of number of legal moves H.G.Muller Sun Aug 12, 2012 8:53 am
                        Re: Counting depth as a function of number of legal moves Pio Korinth Tue Aug 14, 2012 7:28 pm
      Re: Counting depth as a function of number of legal moves Laszlo Gaspar Thu Mar 01, 2012 2:26 pm
            Re: Counting depth as a function of number of legal moves Álvaro Begué Thu Mar 01, 2012 7:16 pm
                  Re: Counting depth as a function of number of legal moves Karlo Bala Jr. Thu Mar 01, 2012 8:49 pm
                        Re: Counting depth as a function of number of legal moves Álvaro Begué Thu Mar 01, 2012 9:02 pm
                              Re: Counting depth as a function of number of legal moves Pio Korinth Thu Mar 01, 2012 10:48 pm
                                    Re: Counting depth as a function of number of legal moves Pio Korinth Thu Aug 09, 2012 9:52 pm
      Re: Counting depth as a function of number of legal moves Joona Kiiski Fri Mar 02, 2012 11:18 am
            Re: Counting depth as a function of number of legal moves Uri Blass Fri Mar 02, 2012 8:40 pm
Post new topic    TalkChess.com Forum Index -> Computer Chess Club: Programming and Technical Discussions

 
Jump to:  
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum




Powered by phpBB © 2001, 2005 phpBB Group
Enhanced with Moby Threads