Search results

Jump to: navigation, search
  • ...<ref>[http://www.talkchess.com/forum/viewtopic.php?t=39073 EBF definition problem in chess wiki] by [[Daniel Shawul]], [[CCC]], May 13, 2011</ref>. * [http://www.talkchess.com/forum/viewtopic.php?t=39073 EBF definition problem in chess wiki] by [[Daniel Shawul]], [[CCC]], May 13, 2011
    9 KB (1,311 words) - 18:22, 12 March 2021
  • * [https://www.stmintz.com/ccc/index.php?id=281989 Re: Chezzz 1.0.1 - problem solved - for David Rasmussen] by [[David Rasmussen]], [[CCC]], February 05,
    39 KB (5,372 words) - 19:58, 16 November 2020
  • With bitboard serialization one minor problem is the relative order in [[Move Generation|move generation]] considering [[ ...ubsets are, the less efficient this hashing technique. This might become a problem since bitboard move-generation is essentially about subsets of moves with c
    14 KB (2,006 words) - 10:30, 11 April 2020
  • * [[Fridel Fainshtein]] ('''2006'''). ''An Orthodox k-Move Problem-Composer for Chess Directmates''. M.Sc. thesis, [[Bar-Ilan University]], [
    14 KB (1,553 words) - 10:05, 4 November 2021
  • * [[Hans Berliner]] ('''1974'''). ''Chess as Problem Solving: The Development of a Tactics Analyser''. '''Ph.D. thesis''', [[Car ...Hans Berliner]] ('''1977'''). ''A Representation and Some Mechanisms for a Problem-Solving Chess Program.'' [[Advances in Computer Chess 1]]
    15 KB (1,973 words) - 22:14, 30 November 2021
  • * [[Fridel Fainshtein]] ('''2006'''). ''An Orthodox k-Move Problem-Composer for Chess Directmates''. M.Sc. thesis, [[Bar-Ilan University]], [h ...''2007'''). ''Evolution of an Efficient Search Algorithm for the Mate-In-N Problem in Chess''. [http://www.informatik.uni-trier.de/~%20LEY/db/conf/eurogp/euro
    16 KB (2,217 words) - 21:27, 5 August 2021
  • ...talkchess.com/forum/viewtopic.php?t=60193 Surprisingly difficult stalemate problem (for some engines)] by Juha Nieminen, [[CCC]], May 16, 2016
    12 KB (1,753 words) - 21:35, 23 February 2021
  • * [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=41542 Problem with bitboard knight attack generator] by [[Matthew R. Brades|ZirconiumX]],
    11 KB (1,309 words) - 18:16, 27 June 2020
  • ...://en.wikipedia.org/wiki/Wheat_and_chessboard_problem Wheat and chessboard problem]
    3 KB (469 words) - 22:50, 8 March 2019
  • ...treet-Fighting Mathematics: The Art of Educated Guessing and Opportunistic Problem Solving]''. [https://en.wikipedia.org/wiki/MIT_Press MIT Press]
    6 KB (896 words) - 09:22, 23 May 2018
  • ...g-Shannon-s-Problem-Ways-and-Means/id/BLCP%3ACN011979464 Solving Shannon's Problem: Ways and Means]''. [[Advances in Computer Chess 7]]
    9 KB (1,205 words) - 16:17, 10 May 2018
  • ...forum.net/cgi-bin/rybkaforum/topic_show.pl?pid=552902 Final Report on Draw Problem in Correspondence Chess] by [[Arno Nickel|Ciron]], [[Computer Chess Forums| ...forum.net/cgi-bin/rybkaforum/topic_show.pl?pid=552902 Final Report on Draw Problem in Correspondence Chess] by [[Arno Nickel|Ciron]], [[Computer Chess Forums|
    11 KB (1,553 words) - 08:27, 3 December 2023
  • * Editor ('''1979'''). ''Chess Ratings from Problem Solving''. [[Personal Computing#3_12|Personal Computing, Vol. 3, No. 12]], * [http://www.talkchess.com/forum/viewtopic.php?t=21348 Problem suite testing - how to extract a useful number] by [[Don Dailey]] from [[CC
    20 KB (2,671 words) - 21:31, 5 August 2021
  • * [http://www.jimloy.com/chess/mirror1.htm A "Mirror" Chess Problem] from [http://www.jimloy.com/chess/chess.htm Jim Loy's Chess Pages]
    9 KB (1,354 words) - 21:37, 15 May 2018
  • Decoding Gray code is a parallel prefix problem similar to the ring-wise operations of the [[#ParityWords|Parity words]]. F A '''parallel prefix''' problem is of the sort:
    19 KB (2,539 words) - 00:13, 12 April 2021
  • ...ook at the way computer chess programs operate today. The most significant problem with PC-oriented (non 64-bit) programs is the lack of speed associated with The real problem comes in trying to combine the forward and '''reverse bitboards''' - there
    13 KB (2,038 words) - 09:02, 11 May 2018
  • ...2003 <ref>[https://www.stmintz.com/ccc/index.php?id=339076 Re: Unexpected problem with futility pruning?] by [[Tord Romstad]], [[CCC]], December 29, 2003</re
    4 KB (600 words) - 21:05, 9 September 2020
  • ...olution to a problem depends on solutions to smaller instances of the same problem.
    17 KB (2,415 words) - 12:56, 19 November 2021
  • ...). ''[http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-1.html The Problem with Threads]''. Technical Report No. UCB/EECS-2006-1, [[University of Cali * [http://www.talkchess.com/forum/viewtopic.php?t=26208 SMP hashing problem] by [[Robert Hyatt]], [[CCC]], January 24, 2009 ยป [[Shared Hash Table#Lock
    86 KB (11,607 words) - 18:34, 11 November 2021
  • ...ps://en.wikipedia.org/wiki/Dining_philosophers_problem Dining philosophers problem from Wikipedia]</ref> ]] * [http://www.talkchess.com/forum/viewtopic.php?t=26208 SMP hashing problem] by [[Robert Hyatt]], [[CCC]], January 24, 2009
    26 KB (3,729 words) - 09:42, 7 October 2021

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)