You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.
In Neither Victim nor Survivor: Thinking toward a New Humanity, Marilyn Nissim-Sabat offers a comprehensive critique of the interrelated concepts of 'victim' and 'survivor' as they have been ideologically distorted in Western thought. Framed by the phenomenological perspective of Edmund Husserl, Nissim-Sabat carries out her argument through an intense engagement with current scholarly work on Toni Morrison's Beloved, Sophocles' Antigone, akrasia, psychoanalysis, critical race theory, feminist philosophy of science, and Marxism. Nissim-Sabat ultimately proposes that a new consciousness, enabled by the phenomenological attitude, of the way in which ideological distortion of the concepts of 'victim' and 'survivor' helps to perpetuate victimization will empower us to find ways to end victimization and its anti-human consequences. The book's interdisciplinary approach will make it appealing to a broad range of students and scholars alike.
This book constitutes the refereed proceedings of the 7th International Conference on Computers and Games, CG 2010, held in Kanazawa, Japan, in September 2010. The 24 papers presented were carefully reviewed and selected for inclusion in this book. They cover a wide range of topics such as monte-carlo tree search, proof-number search, UCT algorithm, scalability, parallelization, opening books, knowledge abstraction, solving games, consultation of players, multi-player games, extraversion, and combinatorial game theory. In addition a wide range of computer games is dealt with, such as Chinese Checkers, Chinese Chess, Connect6, Go, Havannah, Lines of Action, Pckomino, Shogi, Surakarta, and Yahtzee.
The Computers and Games (CG) series began in 1998 with the objective of showcasing new developments in arti?cial intelligence (AI) research that used games as the experimental test-bed. The ?rst two CG conferences were held at Hamamatsu,Japan(1998,2000).ComputersandGames2002(CG2002)wasthe third event in this biennial series. The conference was held at the University of Alberta(Edmonton,Alberta,Canada),July25–27,2002.Theprogramconsisted of the main conference featuring refereed papers and keynote speakers, as well as several side events including the Games Informatics Workshop, the Agents in Computer Games Workshop, the Trading Agents Competition, and the North American Computer Go Champion...
This volume constitutes the thoroughly refereed post-conference proceedings of the Twelfth Advances in Computer Games Conference, ACG 2009, held in Pamplona, Spain, in May 2009. The 20 revised full papers presented were carefully reviewed and selected from 41 submissions for inclusion in the book. The topics addressed contain Monte-Carlo tree search, Bayesian modeling, selective search, brute force, conflict resolution, solving games, optimization, concept discovery, incongruity theory, and data assurance.
As communities struggle to make sense of mass atrocities, expectations have increasingly been placed on international criminal courts to render authoritative historical accounts of episodes of mass violence. Taking these expectations as its point of departure, this book seeks to understand international criminal courts through the prism of their historical function. The book critically examines how such courts confront the past by constructing historical narratives concerning both the culpability of the accused on trial and the broader mass atrocity contexts in which they are alleged to have participated. The book argues that international criminal courts are host to struggles for historical...
Is Nine-Men Morris, in the hands of perfect players, a win for white or for black - or a draw? Can king, rook, and knight always defeat king and two knights in chess? What can Go players learn from economists? What are nimbers, tinies, switches and minies? This book deals with combinatorial games, that is, games not involving chance or hidden information. Their study is at once old and young: though some games, such as chess, have been analyzed for centuries, the first full analysis of a nontrivial combinatorial game (Nim) only appeared in 1902. The first part of this book will be accessible to anyone, regardless of background: it contains introductory expositions, reports of unusual tournaments, and a fascinating article by John H. Conway on the possibly everlasting contest between an angel and a devil. For those who want to delve more deeply, the book also contains combinatorial studies of chess and Go; reports on computer advances such as the solution of Nine-Men Morris and Pentominoes; and theoretical approaches to such problems as games with many players. If you have read and enjoyed Martin Gardner, or if you like to learn and analyze new games, this book is for you.
One of the earliest dreams of the fledgling field of artificial intelligence (AI) was to build computer programs that could play games as well as or better than the best human players. Despite early optimism in the field, the challenge proved to be surprisingly difficult. However, the 1990s saw amazing progress. Computers are now better than humans in checkers, Othello and Scrabble; are at least as good as the best humans in backgammon and chess; and are rapidly improving at hex, go, poker, and shogi. This book documents the progress made in computers playing games and puzzles. The book is the definitive source for material of high-performance game-playing programs.
This book constitutes the thoroughly refereed post-conference proceedings of the 9th International Conference on Computers and Games, CG 2016, held in Leiden, The Netherlands,in conjunction with the 19th Computer Olympiad and the 22nd World Computer-Chess Championship. The 20 papers presented were carefully reviewed and selected of 30 submitted papers. The 20 papers cover a wide range of computer games and many different research topics in four main classes which determined the order of publication: Monte Carlo Tree Search (MCTS) and its enhancements (seven papers), concrete games (seven papers), theoretical aspects and complexity (five papers) and cognition model (one paper). The paper Using Partial Tablebases in Breakthrough by Andrew Isaac and Richard Lorentz received the Best Paper Award.
This book constitutes the thoroughly refereed post-conference proceedings of the 13th Advances in Computer Games Conference, ACG 2011, held in Tilburg, The Netherlands, in November 2011. The 29 revised full papers presented were carefully reviewed and selected from numerous submissions. The papers cover a wide range of topics such as Monte-Carlo tree search and its enhancement, temporal difference learning, optimization, solving and searching, analysis of a game characteristic, new approaches, and serious games.
In a galaxy of cutthroat companies, shadowy clans and a million agendas, spy agency RIM barely wields enough control to keep order. Maximus Black is RIM’s star cadet. But he has a problem. One of RIM’s best agents, Anneke Longshadow, knows there’s a mole in the organisation. And Maximus has a lot to hide.