 |
Set (game)
''Set'' (stylized as SET or SET!) is a real-time card game designed by Marsha Falco in 1974 and published by Set Enterprises in 1991. The deck consists of 81 unique cards that vary in four features across three possibilities for each kind of feature: number of shapes (one, two, or three), shape (diamond, squiggle, oval), shading (solid, striped, or open), and color (red, green, or purple). Each possible combination of features (e.g. a card with three striped green diamonds) appears as a card precisely ''once'' in the deck. Gameplay In the game, certain combinations of three cards are said to make up a "set". For each one of the four categories of features—color, number, shape, and shading—the three cards must display that feature as either a) all the same, or b) all different. Put another way: For each feature the three cards must ''avoid'' having two cards showing one version of the feature and the remaining card showing a different version. For example, 3 solid red di ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
|
Real-time Card Game
A real-time card game is a card game in which there are no Game mechanics, turns and all players may act simultaneously (that is, in real-time). The card game Set (card game), Set has a real-time element; in Set, the players are racing to identify patterns in the cards on the table. The concept was also used by James Ernest in his game Falling (game), Falling, and was later expanded in the games Brawl (game), Brawl and Fightball. There are also real-time card games that use a standard deck of 52 playing cards. A large number of real-time card games are in the Slapjack family: players take turns playing cards and then race to "slap" a jack or face card when it is turned up. In this family are Spit (card game), Spit, Egyptian Ratscrew, and Nerts. Another group of real-time card games are related to Pig (card game), Spoons, in which players exchange cards asynchronously until one or more players have a certain hand; then the first player to perform a certain action wins. In this fami ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
|
|
Diane Maclagan
Diane Margaret Maclagan (born 1974) is a professor of mathematics at the University of Warwick. She is a researcher in combinatorial and computational commutative algebra and algebraic geometry, with an emphasis on toric varieties, Hilbert schemes, and tropical geometry. Education and career As a student at Burnside High School in Christchurch, New Zealand, Maclagan competed in the International Mathematical Olympiad in 1990 and 1991, earning a bronze medal in 1991. As an undergraduate, she studied at the University of Canterbury, graduating in 1995. She did her PhD at the University of California, Berkeley, graduating in 2000. Her dissertation, ''Structures on Sets of Monomial Ideals'', was supervised by Bernd Sturmfels. After postdoctoral research at the Institute for Advanced Study, Maclagan was a Szegő Assistant Professor at Stanford University from 2001 to 2004, an assistant professor at Rutgers University from 2004 to 2007, then an associate professor there from 2007 t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
|
|
Card Games Introduced In 1991
Card or The Card may refer to: Common uses * Plastic cards of various types: **Bank card ** Credit card **Debit card **Payment card * Playing card, used in games * Printed circuit board, or card * Greeting card, given on special occasions Arts and entertainment * ''The Card'', a 1911 novel by Arnold Bennett ** ''The Card'' (1922 film), based on the novel ** ''The Card'' (1952 film), based on the novel ** ''The Card'' (musical), 1973, based on the novel * ''The Card'', a 2012 novel by Graham Rawle * "The Card" (''The Twilight Zone''), a TV episode * "The Card", an episode of ''SpongeBob SquarePants'' (season 6) Businesses and organisations * American Committee for Devastated France (''Comité Américain pour les Régions Dévastées de France''), a group of American women in France after * Campaign Against Racial Discrimination, a British organization, founded in 1964–67 * Center for Autism and Related Disorders, an American applied behavior analysis provider * Wolfson ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
|
|
ActiveState
ActiveState Software Inc is a Canadian software company headquartered in Vancouver, British Columbia. It develops, sells, and supports cross-platform development tools and secure software supply chain solutions for dynamic languages such as Perl, PHP, Python, Ruby and Tcl, as well as enterprise services. ActiveState is owned by its employees and Vertu Capital, a growth equity firm based in Ontario, Canada after briefly being a member of the Sophos group. History Acquisition of ActiveState Corp was first announced in September 2003 by Sophos Plc. ActiveState's president Steve Munford, who is part of the acquisition will become a member of Sophos's executive management team as Global VP Messaging. Sophos ownership era In January 2006, the Pender Financial Group, which was announced in January 2006 has agreed with Sophos Inc. to acquire DeactiveState Software Inc. In February 2006, ActiveState Software Inc. announced its acquisition by Pender Financial Group Corporation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
|
|
Tcl/Tk
Tk is a cross-platform widget toolkit that provides a library of basic elements of GUI widgets for building a graphical user interface (GUI) in many programming languages. It is free and open-source software released under a BSD-style software license. Tk provides many widgets commonly needed to develop desktop applications, such as button, menu, canvas, text, frame, label, etc. Tk has been ported to run on most flavors of Linux, macOS, Unix, and Microsoft Windows. Like Tcl, Tk supports Unicode within the Basic Multilingual Plane, but it has not yet been extended to handle the current extended full Unicode (e.g., UTF-16 from UCS-2 that Tk supports). Tk was designed to be extended, and a wide range of extensions are available that offer new widgets or other capabilities. Since Tcl/Tk 8, it offers "native look and feel" (for instance, menus and buttons are displayed in the manner of "native" software for any given platform). Highlights of version 8.5 include a new theming engine ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
|
 |
Fano Plane
In finite geometry, the Fano plane (named after Gino Fano) is a finite projective plane with the smallest possible number of points and lines: 7 points and 7 lines, with 3 points on every line and 3 lines through every point. These points and lines cannot exist with this pattern of incidences in Euclidean geometry, but they can be given coordinates using the finite field with two elements. The standard notation for this plane, as a member of a family of projective spaces, is . Here, stands for "projective geometry", the first parameter is the geometric dimension (it is a plane, of dimension 2) and the second parameter is the order (the number of points per line, minus one). The Fano plane is an example of a finite incidence structure, so many of its properties can be established using combinatorial techniques and other tools used in the study of incidence geometries. Since it is a projective space, algebraic techniques can also be effective tools in its study. In a separate ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
|
Lisa Sauermann
Lisa Sauermann (born 25 September 1992) is a mathematician from Germany known for her performance in the International Mathematical Olympiad, where in 2011 she had the single highest (and perfect) score. She won four gold medals (2008–2011) and one silver medal (2007) at the olympiad, representing Germany. Sauermann attended Martin-Andersen-Nexö-Gymnasium Dresden when she was in 12th grade. She won the Franz Ludwig Gehe Prize in 2011 and the gold medal in the age group III, the 11th–12th grade competition. As a result, she won a trip to the Royal Academy of Sciences in Stockholm. To achieve this, she presented a new mathematical theorem with a proof in a work entitled "Forests with Hypergraphs". In 2011 she began studying mathematics at the University of Bonn. In 2014, she completed her bachelor thesis on algebraic geometry under Michael Rapoport. She became a graduate student studying with Jacob Fox at Stanford University where she obtained her PhD in 2019, receiving two ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
|
|
Projective Set (game)
Projective Set (sometimes shortened to ProSet) is a real-time card game derived from the older game ''Set''. The deck contains cards consisting of colored dots; some cards are laid out on the table and players attempt to find "Sets" among them. The word ''projective'' comes from the game's relation to projective spaces over the finite field with two elements. Projective Set has been studied mathematically as well as played recreationally. It has been a popular game at Canada/USA Mathcamp. Rules A Projective Set card has six binary attributes, or bits, generally represented by colored dots. For each color of dot, each card either has that dot or does not. There is one card for each possible combination of dots except the combination of no dots at all, making 2^6 - 1 = 63 cards total. Three cards are said to form a "set" if the total number of dots of each color is either 0 or 2. Similarly, four or more cards form a "set" if the number of dots of each color is an even numb ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
|
 |
Games (magazine)
''Games World of Puzzles'' is an American games and puzzle magazine. Originally the merger of two other puzzle magazines spun off from its parent publication ''Games'' magazine in the early 1990s, ''Games World of Puzzles'' was reunited with ''Games'' in October 2014. The entire magazine interior is now newsprint (as opposed to the part-glossy/part-newsprint format of the original ''Games'') and the puzzles and articles that originally sandwiched the "Pencilwise" section are now themselves sandwiched ''by'' the main puzzle pages, replacing the "feature puzzle" section (they are still full-color, unlike the two-color "Pencilwise" sections.) The recombined title assumed the same 9-issue-per-year publication schedule as the original ''Games''. ''Games'' ''Games'' () was a magazine devoted to games and puzzles and, until its 2014 merger was published by Games Publications, a division of Kappa Publishing Group. History ''Games'' debuted with its September/October 1977 issue, publi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
 |
NP-completeness
In computational complexity theory, NP-complete problems are the hardest of the problems to which ''solutions'' can be verified ''quickly''. Somewhat more precisely, a problem is NP-complete when: # It is a decision problem, meaning that for any input to the problem, the output is either "yes" or "no". # When the answer is "yes", this can be demonstrated through the existence of a short (polynomial length) ''solution''. # The correctness of each solution can be verified quickly (namely, in polynomial time) and a brute-force search algorithm can find a solution by trying all possible solutions. # The problem can be used to simulate every other problem for which we can verify quickly that a solution is correct. Hence, if we could find solutions of some NP-complete problem quickly, we could quickly find the solutions of every other problem to which a given solution can be easily verified. The name "NP-complete" is short for "nondeterministic polynomial-time complete". In this name, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
|
Donald Knuth
Donald Ervin Knuth ( ; born January 10, 1938) is an American computer scientist and mathematician. He is a professor emeritus at Stanford University. He is the 1974 recipient of the ACM Turing Award, informally considered the Nobel Prize of computer science. Knuth has been called the "father of the analysis of algorithms". Knuth is the author of the multi-volume work '' The Art of Computer Programming''. He contributed to the development of the rigorous analysis of the computational complexity of algorithms and systematized formal mathematical techniques for it. In the process, he also popularized the asymptotic notation. In addition to fundamental contributions in several branches of theoretical computer science, Knuth is the creator of the TeX computer typesetting system, the related METAFONT font definition language and rendering system, and the Computer Modern family of typefaces. As a writer and scholar, Knuth created the WEB and CWEB computer programming systems des ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
|
 |
Cap Set
In affine geometry, a cap set is a subset of the affine space \mathbb_3^n (the n-dimensional affine space over the three-element field) where no three elements sum to the zero vector. The cap set problem is the problem of finding the size of the largest possible cap set, as a function of n.. The first few cap set sizes are 1, 2, 4, 9, 20, 45, 112, ... . Caps are defined more generally as subsets of a finite affine or projective space with no three in a line. The "cap set" terminology should be distinguished from other unrelated mathematical objects with the same name, and in particular from sets with the compact absorption property in function spaces as well as from compact convex co-convex subsets of a convex set. Example An example of cap sets comes from the card game Set, a card game in which each card has four features (its number, symbol, shading, and color), each of which can take one of three values. The cards of this game can be interpreted as representing points of th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |