Hi! I think i have a solution for this!
Go to move 10 in Game 1, and -> search ->current Board ->Search in reference database (where the other game is stored) and then merge from there (second game) . For me, that works (haven't tried your example, but i remember from the past), hopefully it works in your case, too) Greets, Philipp Am 2011-08-24 10:08, schrieb sous...@free.fr: > Hi, > Thanks for your reply. > 1) Unfortunately, the first solution does not work. The merge game has a > non-standard start position. > 2) As you mentionned, this option may work but it is too much time-consuming! > > Interestingly, Scid recognizes some transpositions in games. For instance, in > the Sicilian Keres attack Scid correctly merges games despite different move > orders to reach the move 6.g4. Probably move 10 is too far from the beginning. > Cheers > Jos > >> Dear scidlisters, >> I have an issue which has recently come up dealing with the merge function. >> >> I am using Scid 4.3. >> >> Is it possible to merge a game at a choosen move? >> Scid does not always recognize that two games have reached the same position >> with different move orders. Thus, the merge is not properly made. > In list view, Scid does not recognize transpositions in games. In tree > view it may do. > If you create a small database with only these two games, the tree works > exactly as you expect. I am not sure, but you may be able to save the > tree as a single new game. This game should show two variations: One > after 2.Nf3 and one after 10... Nbd7 > > I have two manual workaround suggestions (I hope you do not need to do > this for many games!): > > 1. (may work) > * Open game 2 and go to the position after 10.... Nbd7 > * Strip moves from the beginning (make it start at move 11.Nb3 from a > FEN start position) > * save this game as a (temporary) new game. > * Merge this stripped copy of game 2, into game 1. This may work, but I > did not test this myself. > * Delete the temporary copy. > > 2. (certainly works, but takes some time) > * Open game 1 and go to the position after 10....Nbd7 > * Enter the moves as they were played in game 2, starting with 11.Nb3 > * save the game as a new game using the data from game 2. > * Reopen game 1 and merge the patched copy of game 2 > * Delete the temporary copy. > > Depending on how you want the merge result stored, exact operations can > be simplified a bit (but I guess you got that point). > > Cheers, > Joost. > > >> For instance, the following two games have reached the same position at move >> 10 with a complete different move order. >> >> Ivanchuk, Vassily (2719) -- Rublevsky, Sergei (2670) >> EU-Cup 16th (6.1) Neum >> 2000.09.29 0-1 B84 >> >> 1.e4 c5 2.Nf3 e6 3.d4 cxd4 4.Nxd4 a6 5.Be2 Nf6 6.Nc3 Qc7 7.O-O d6 8.a4 Be7 >> 9.a5 O-O 10.Be3 Nbd7 11.g4 h6 12.f4 d5!? 13.exd5 Nxd5 14.Nxd5 exd5 15.Nf5 >> Nf6 16.Nxe7+ Qxe7 17.Ra3 Be6 18.Bf3 Rfe8 19.Bd4 Ne4 20.Re3 f5 21.c4 Rad8 >> 22.cxd5 Bxd5 23.gxf5 Qf7 24.Rfe1 Qxf5 25.Qc2 Bc6 26.Bxe4? Rxe4 27.Rxe4 Qg6+ >> 28.Kf2 Rxd4 29.Qxc6 □ Qxc6 30.Rxd4 Qc5 31.Re4 Qxa5 32.b4 Qa3 33.Kg2 Qc3 >> 34.Rd8+ Kh7 35.Rdd4 b6 36.f5 a5! 37.bxa5 bxa5 38.Ra4 Qc5 39.Rf4 Qd5+ 40.Kg3 >> Qd3+ 41.Kg2 Qe3 42.Rf2 Qg5+ 43.Kf1?? Qc1+ 0-1 >> >> Adams, Michael (2724) -- Hou, Yifan (2523) >> UK-CHN (6) Liverpool >> 2007.09.09 1-0 B84 >> >> 1.e4 c5 2.Nf3 d6 3.d4 cxd4 4.Nxd4 Nf6 5.Nc3 a6 6.Be2 e6 7.O-O Be7 8.a4 Qc7 >> 9.a5 O-O 10.Be3 Nbd7 11.Nb3 b5 12.axb6 Nxb6 13.Qd4 Nbd7 14.Rfd1 Ne5 15.Qb6 >> Qxb6 16.Bxb6 Bb7 17.f3 Nc6 18.Ra4 h6 19.Kf1 Rfc8 20.Bf2 Rcb8 21.Bg3 Rd8 >> 22.Rda1 Rab8 23.Nd1 Bc8 24.Na5 Nxa5 25.Rxa5 e5 26.Bxa6 Be6 27.b3 Nh5 28.Ne3 >> Nxg3+ 29.hxg3 Bg5 30.Ke2 g6 31.Bd3 Bxe3 32.Kxe3 f5 33.Ra7 fxe4 34.Bxe4 Bf7 >> 35.R1a6 Rb4 36.Rc7 Rd4 37.Raa7 Rf8 38.c3 Rd1 39.Ke2 1-0 >> >> How to force the second game to merge at move 10 in the first game? And not >> at move 2! >> Can anyone please help me out? >> Thanks! >> Jos >> >> ------------------------------------------------------------------------------ >> EMC VNX: the world's simplest storage, starting under $10K >> The only unified storage solution that offers unified management >> Up to 160% more powerful than alternatives and 25% more efficient. >> Guaranteed. http://p.sf.net/sfu/emc-vnx-dev2dev >> _______________________________________________ >> Scid-users mailing list >> Scid-users@lists.sourceforge.net >> https://lists.sourceforge.net/lists/listinfo/scid-users > > ------------------------------------------------------------------------------ > EMC VNX: the world's simplest storage, starting under $10K > The only unified storage solution that offers unified management > Up to 160% more powerful than alternatives and 25% more efficient. > Guaranteed. http://p.sf.net/sfu/emc-vnx-dev2dev > _______________________________________________ > Scid-users mailing list > Scid-users@lists.sourceforge.net > https://lists.sourceforge.net/lists/listinfo/scid-users > > ------------------------------------------------------------------------------ > EMC VNX: the world's simplest storage, starting under $10K > The only unified storage solution that offers unified management > Up to 160% more powerful than alternatives and 25% more efficient. > Guaranteed. http://p.sf.net/sfu/emc-vnx-dev2dev > _______________________________________________ > Scid-users mailing list > Scid-users@lists.sourceforge.net > https://lists.sourceforge.net/lists/listinfo/scid-users ------------------------------------------------------------------------------ EMC VNX: the world's simplest storage, starting under $10K The only unified storage solution that offers unified management Up to 160% more powerful than alternatives and 25% more efficient. Guaranteed. http://p.sf.net/sfu/emc-vnx-dev2dev _______________________________________________ Scid-users mailing list Scid-users@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/scid-users
