Ply (chess) - Factbites

Ply (chess) - Factbites
Where results make sense
About us | Why use us? | Reviews | PR | Contact us

Topic: Ply (chess)

Note: these results are not from the primary (high quality) database.

In the News (Wed 23 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Daily Chess Columns
		He was very interested in chess, but in spite of having a brilliant intellect and putting a lot of effort into learning the game he remained a fairly weak player.
		While computers are gaining a substantial advantage from the vast amount of openings knowledge that has accumulated in the history of chess, they also profit from a research at the other end of the game.
		It won the world computer chess championship and all other computer tournaments from 1980 to 1983, until it was superseded by giant Cray X-MPs costing a thousand times more.
	www.chessbase.com /columns/column.asp?pid=102 (2279 words)

	bramcohen: Eliminating draws from Chess
		Chess is fun because ply destroy information about the result, but some leaks through in the form of patterns (and of course, material balance).
		Here's an idea for eliminating draws from chess: add a 'tiebreak' rule, which is that games which are draws under the regular rules are instead won by the last player to have made a capture.
		A common tactic in Chess is an exchange or sacrifice.
	bramcohen.livejournal.com /23677.html (2640 words)

	Maybe Someday They Will Be Good
		Sargon was not any great help, but he did not have to reply until morning.
		After a few minutes Sargon 4 was up to 7 ply and it said the best move was 19…Bd6.
		Still, he did not have any games for his Apple and he did like chess.
	mywebpages.comcast.net /danheisman/Articles/story_someday.htm (2640 words)

	chess
		(or "ply" as it's as its referred to in computer chess terminology), all possible moves are examined,
		the years, chess masters have developed what is essentially an encyclopedia of these openings.
		The core of the chess playing algorithm is a local min-max search of the gamespace.
	www.cs.cornell.edu /boom/2004sp/ProjectArch/Chess/algorithms.html (2363 words)

	Cilkchess
		(Although this goes against common parallel programming practice, it certainly is fast and seems to work well in practice.) In the late middle game, Cilkchess typically looks more than 15 ply (half moves) ahead and performs 5-11 million make-moves per second on a 256-processor SGI Origin 2000.
		Implementing a state-of-the-art parallel chess program has had a marked influence on the design of Cilk, which is targeted as a platform delivering both high performance and ease of programming.
		The parallelism in computer chess is derived from a dynamic expansion of a highly irregular game tree, which makes computer chess difficult to express, for example, as a data-parallel program.
	supertech.lcs.mit.edu /chess (409 words)

	Daily Chess Columns
		He was very interested in chess, but in spite of having a brilliant intellect and putting a lot of effort into learning the game he remained a fairly weak player.
		Belle could go down eight to nine ply in tournament games, which enabled it to play in the master category.
		Since there was as yet no machine that could execute the instructions he did so himself, acting as a human CPU and requiring more than half an hour per move.
	www.chessbase.com /columns/column.asp?pid=102 (409 words)

	List of chess topics
		Patrol chess - Pawn - Pawn (chess) - Perpetual check - Tigran Petrosian - François-André Danican Philidor - Harry Nelson Pillsbury - Pin - Pin (chess) - Plachutta - Play by mail game - Ply - Judit Polgar - Zsuzsa Polgar - Ruslan Ponomariov - Portable Game Notation - Promotion -
		This is a list of articles related to chess.
		Babson task - Back rank mate - Baroque chess - Alexander Beliavsky - Henry Bird - Bishop (chess) - Bitboard - Blitz - Blunder - Board game - Board game complexity - Samuel Boden - Bogo-Indian - Efim Bogoljubov - Mikhail Botvinnik - Branching factor - David Bronstein - Bughouse chess - C.
	www.brainyencyclopedia.com /encyclopedia/l/li/list_of_chess_topics.html (409 words)

	Chess Game/Chess Engine Version 2.0
		More information: Migoya-Chess is a chess engine with a respectable game level, it usues a 4 ply min-max (alpha-beta) algorithm, The graphics are not to good but the engine works perfectly.
		It implements new chess-engine heuristics and board value that i invented.
		Once downloaded, open the.zip file from your local drive using WinZip or a comparable program to view the contents.
	www.freevbcode.com /ShowCode.Asp?ID=4980 (409 words)

	Computer Chess
		Early computer chess programs applied a type A strategy, although in 1951 Alan Turing, the British computer pioneer, specified a program to play chess that tried to follow preferably those branches in which a piece is captured.
		Over many years, computer chess was the yardstick used to measure the capabilities of computers when compared to humans.
		Eventually, chess proved to be a more difficult problem than originally thought, but even so on May 11 1997 a computer defeated the reigning world champion, Gary Kasparov, in a dramatic chess tournament.
	www.zib.de /zuse/Inhalt/Programme/Plankalkuel/Chess/chess.htm (950 words)

	Interesting Links
		Arasan - a very strong chess opponent program.
		From the menu bar, Options -> Search Limits -> Fixed Ply can be used to limit its playing strength.
	www.ed-chang.com /links.html (950 words)

	implementation.htm
		Slow Chess will always extend the depth by 1 ply anytime a pawn is moved to the 7th rank.
		Mate threat extension : (extending when the side to move would get mated in 1 move if it passed.) A well done mate threat extension can find some mates much quicker, since it can find when there's a mate possible, but a few delaying moves can delay it 2 to even 6 or more ply.
		Also extending when under mate threat doesn't hurt the branching factor as much as some random extension, because most moves won't counter the threat, they'll only be searched 1 ply deep (at which point mate is declared) no matter how much depth is remaining.
	www.3dkingdoms.com /chess/implementation.htm (950 words)

	Gamasutra - Features - "Pawn Captures Wyvern: How Computers Chess Can Improve Your Pathfinding" [06.26.00]
		The principal variation of a k-ply search is a good starting place to look for a principal variation of a (k+1)-ply search, so the principal variation from the k-ply search is searched first at depth (k+1).
		One method that most practitioners employ is to search the tree to a fixed depth, k ply from the root node, and use approximate minimax value at that level.
		This improves the ordering of the moves in the (k+1)-ply search.
	www.gamasutra.com /features/20000626/brockington_03.htm (950 words)

	search
		First, most computer chess programs use the so-called iterated search where a one ply search is done, then that information is used to order the moves for a two ply search, and the information from that is used to order a three ply search and so forth.
		Search() simply tests to see if the current ply is a split point, and if so it copies the shared move list to the local move list, calls Select() to choose one for searching and then removes it from the move list.
		Another example is that the search extensions used by Cray Blitz at ply=N are affected by the extensions at plies before N in the tree.
	www.cis.uab.edu /hyatt/search.html (10075 words)

	Deep Blue - Wikipedia, the free encyclopedia
		Good human chess players look roughly 10 ply ahead.
		An increase in search depth of one ply corresponds on the average to an increase in playing strength of approximately 80 Elo points.
		Deep Blue was a chess-playing computer developed by IBM.
	en.wikipedia.org /wiki/Deep_Blue (781 words)

	Talk:Chess - Wikibooks
		The Wikisophia Chess markup handles moves only in long algebraic, and not short which all game records use, so in order to use the Wikisophia markup to show a game it has to be translated into long algebraic first which is a pain - the \move or \ply commands only does b1c3, for example.
		The best solution I've seen yet is that chess board tex markup from wikisophia (see it here: http://wikisophia.org/wiki/Wikitex#Chess).
		Or are you against having to reproduce a chess match in part to display a picture of the certain result?
	en.wikibooks.org /wiki/Talk:Chess (1313 words)

	Deep Blue - Wikipedia, the free encyclopedia
		The Deeper Blue chess computer which defeated Kasparov in 1997 could search to a depth of 12 ply.
		One of the two racks that made up Deep Blue is on display at the National Museum of American History in their exhibit about the Information Age; the other rack appears at the Computer History Museum in their "Mastering The Game: A History of Computer Chess" exhibit.
		Deep Blue was the first computer system to win a chess game against a reigning world champion (Garry Kasparov) under regular time controls.
	en.wikipedia.org /wiki/Deep_Blue (710 words)

	Rebel Tiger FAQ - Lokasoft
		When Tiger is pondering a move till lets say 12 ply, and the opponent is playing that move, Tiger nevertheless start computing at the beginning.
		This is a function of the chess engine, this is not (yet) supported by the chess tiger engine.
		The user book is a function of the chess engine, if the engine does not support this function the menu is grayed.
	www.lokasoft.nl /rtfaq.htm (1159 words)

	Man vs. Machine Chess Match
		In typical middle game positions, Socrates will perform a complete search for at least 12 ply* (a ply is one half-move); in endings, Socrates will search at least 15 or 16 ply*.
		Socrates is one of the best computer chess* programs in the world.
		His goal is to popularize chess in the United States and to help introduce chess into the schools curriculum at all levels.
	www.cs.umbc.edu /conferences/mtd95/mm_match (1159 words)

	Counting Nodes in Chess (ResearchIndex)
		Previously, this value was known up to 6 ply, though the value given for the sixth ply was in error.
		Richard Bean Institute for Studies in Theoretical Physics and Mathematics PO...
		A new bound on the size of the largest critical set in a..
	citeseer.ist.psu.edu /680332.html (198 words)

	Slow Chess Blitz, a free chess program
		This is a much stronger chess engine than 2.82a, and the code should be clearer too, and without assembly language.
		Difficulty Level by time per move, number of ply, or number of nodes
		Winboard and UCI support, so you can use it outside its own GUI.
	www.3dkingdoms.com /chess/slow.htm (412 words)

	Protej - A WinBoard chess engine
		Replaced 3-ply minimax search with 4-ply alphabeta search.
		Protej - a WinBoard engine by Alex Brunetti
	e4e6.com /protej (82 words)

	Chess Programming Theory
		If you are searching a PV node, that is you are not currently doing a NULL move, and you haven't got a best move to test from the hashtable, then just do a shallow search from the current position at a depth of (usually) 2 ply shallower.
		The extra time spent in searching for a move at a reduced depth is negligible compared to the gain in speed you can achieve from ordering the best move higher at a much more important ply in the search tree.
		If ColChess comes to do a reduced-width quiescence search at a particular node and it finds that it is in check then it does a full-width search instead.
	www.chessbrain.net /beowulf/theory.html (82 words)

	Monsoon/Typhoon Homepage
		A nullmove search is a forward pruning technique used heavily in microcomputer chess based on this idea: moving twice in a row in chess is a strong (though illegal) advantage.
		So, a nullmove R=2 would search the position after a pass to depth - R - 1 ply.
		So when search probes the table for data about position P and finds data about position Q it will know that a collision has occurred and that the data in the hash is irrelevant.
	perl.guru.org /scott/hobbies/chess (82 words)

	Rebel computer benchmark
		The idea is to take 3 positions provided in within REBEL10 and run them with on a fixed PLY level to ensure equal conditions on every PC.
		Used chess program for the benchmark is REBEL10.
		Here you will find a statistic how the most used types of Pc's will perform on chess programs.
	www.rebel.nl /bench.htm (318 words)

	Game tree - Wikipedia, the free encyclopedia
		Instead, a chess-playing program searches a partial game tree: typically as many ply from the current position as it can search in the time available.
		The game tree for tic-tac-toe is easily searchable, but the complete game trees for larger games like chess are much too large to search.
		Game trees are important in artificial intelligence because one way to pick the best move in a game is to search the game tree using the minimax algorithm or its variants.
	en.wikipedia.org /wiki/Game_tree (426 words)

	analysis
		Position statement: Several heuristics have been proposed as useful, we want to develop understanding of their use: we test them here for small chess trees.
		Topic: We believe that analysis is based on fundamental principles which are generally applicable we illustrate and tst these ideas using computer chess
		Endgames are said to have 8 moves per ply while middle games have 80.
	www.tangbeili.com /analysis.html (426 words)

	The Two Cultures
		What is amazing to a transplanted chess or checker player is the speed at which backgammon is played (in head-to-head competition) and the impatience most players have with slow play.
		A 3-ply analysis is already pretty large (perhaps twenty million or more positions to consider).
		While I took to backgammon reasonably quickly, moving out of the novice phase and into the varying beginner stages in rapid order, the backgammon experience was totally new and differed from chess and checkers in more ways than I ever would have suspected.
	www.bkgm.com /articles/TwoCultures (426 words)

	onegoodmove: Kasparov vs. X3D Fritz
		The fritz program is running on 4 intel 2.8 ghz processors and looks at 4,000,000 positions per second, that translates to an 18 ply search in under 4 minutes.
		This time it will be the Fritz engine, one of the best five chess programs in the world.
		Kasparov won game 3 although I'm not sure the Fritz programmers resigning down a pawn in a technically lost position is a win I would want.
	onegoodmove.org /1gm/1gmarchive/000983.html (733 words)

	Chess software - Shredder 8 — Double World Champion 2003
		Shredder 8 also gives you free access to the Playchess.com server for a full year.
		The world champion chess program “Shredder 8” for single and multi-processor systems.
		In fast games Shredder produces searches that are an average of two ply deeper than its predecessor.
	www.chessbase.com /shop/product.asp?pid=193 (965 words)

Try your search on: Qwika (all wikis)

Topic: Ply (chess)

Ads by Google

Related Topics

In the News (Wed 23 Dec 09)