| View previous topic :: View next topic |
| Author |
Message |
Uri Blass
Joined: 08 Mar 2006 Posts: 5958 Location: Tel-Aviv Israel
|
Post subject: Re: An instructive problem Posted: Wed May 30, 2007 9:52 pm |
|
|
| mambofish wrote: |
I am seriously impressed that you admit checks in the qsearch! How do you know which move is a check without searching? I did try that once but abandoned it as too costly
Leaving that aside though, the problem I have with this explanation is simply that movei's own analysis doesn't appear to support your conclusions. The fact that movei considers the best response to 3 .. f6 to be a sequence of moves starting with Qh8+ must surely indicate it hasn't seen the consequence of g6. Otherwise that line would terminate much earlier.
Please understand that I intend no disrespect by this - I am sure that movei would eat ermintrude for breakfast. But I don't accept the explanation that some sort of static analysis after g6 is somehow directing movei to find Bg4 as a better move
Kind regards
Vince |
1)I explained that I also have pruning and not only checks in the qsearch so movei simply did not search after g6 so it did not get into the qsearch.
The checking line was not pruned but g6 is a quite move so it did not cause extension and together with the pruning that I do after g6 based on evaluation black moves were not searched.
2)I know that a move is check without searching simply based on the from and the to square of the piece(in most cases they tell me that it is not check).
Movei can solve wac number 1 in depth 2 thanks to checks in the qsearch.
New game
2rr3k/pp3pp1/1nnqbN1p/3pN3/2pP4/2P3Q1/PPB4P/R4RK1 w - - 0 1
Analysis by Movei00_8_403:
1.Nf6-e8
³ (-0.69) Depth: 1 00:00:00
1.Nf6-e8
³ (-0.39) Depth: 2 00:00:00
1.Nf6-e8
² (0.31) Depth: 2 00:00:00
1.Nf6-e8 Rd8xe8 2.Ne5xf7+ Be6xf7 3.Qg3xd6
+- (2.27) Depth: 2 00:00:00
1.Qg3-g6
+- (2.28) Depth: 2 00:00:00
1.Qg3-g6
+- (2.57) Depth: 2 00:00:00
1.Qg3-g6 f7xg6 2.Ne5xg6#
+- (#2) Depth: 2 00:00:00
1.Qg3-g6 f7xg6 2.Ne5xg6#
+- (#2) Depth: 2 00:00:00
(, 31.05.2007)
Uri |
|
| Back to top |
|
 |
|
| Subject |
Author |
Date/Time |
An instructive problem |
mambofish |
Fri May 25, 2007 6:23 pm |
Re: An instructive problem |
Pradu Kannan |
Fri May 25, 2007 7:31 pm |
Re: An instructive problem |
Gerd Isenberg |
Fri May 25, 2007 8:05 pm |
Re: An instructive problem |
Vincent Diepeveen |
Sat May 26, 2007 7:19 pm |
Re: An instructive problem |
mambofish |
Wed May 30, 2007 12:47 am |
Re: An instructive problem |
mambofish |
Fri May 25, 2007 8:10 pm |
Re: An instructive problem |
Vincent Diepeveen |
Sat May 26, 2007 7:17 pm |
Re: An instructive problem |
Uri Blass |
Wed May 30, 2007 12:57 pm |
Re: An instructive problem |
mambofish |
Wed May 30, 2007 3:24 pm |
Re: An instructive problem |
Uri Blass |
Wed May 30, 2007 4:06 pm |
Re: An instructive problem |
mambofish |
Wed May 30, 2007 9:02 pm |
Re: An instructive problem |
Alessandro Scotti |
Wed May 30, 2007 9:35 pm |
Re: An instructive problem |
mambofish |
Wed May 30, 2007 10:00 pm |
Re: An instructive problem |
Alessandro Scotti |
Wed May 30, 2007 10:14 pm |
Re: An instructive problem |
Uri Blass |
Wed May 30, 2007 9:52 pm |
Re: An instructive problem |
mambofish |
Wed May 30, 2007 10:40 pm |
|
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
|
|