Wikipedia:Reference desk/Computing: Difference between revisions

Content deleted Content added
Florin747 (talk | contribs)
Florin747 (talk | contribs)
Line 151:
:For context, see [[Karatsuba algorithm]].-<span style="font-family:cursive; color:grey;">[[User talk:gadfium|gadfium]]</span> 20:46, 13 April 2020 (UTC)
 
Hi, Thank You for the replies, I was thinking at the situation of avoding any invertions on 4 plices, basicaly optimizing the search on minmax algo with an factor of up to 4 for those 2 moves/4 plices. I was thinkngthinking about those 120 zeros for the minimax estimation search ( I mean 10^120 positions to be calculated, in case we dont wish to use working some working memory, which might be helpful about that). Fot some minimax 40 depth moves search then will be able to get about 2^40 optimizing time factor which is about 10^12. There is more about this idea of mine (too) but I dont think I should boost around that , since chess is some hot topics all around the world and therefore it is very very well studied I would say. Thank You, for letting me post that, I find it very much fun in did! [[User:Florin747|Florin747]] ([[User talk:Florin747|talk]]) 07:14, 14 April 2020 (UTC)
 
== Amiga PAL resolution ==