The Kasparov-World Match

The Kasparov-World match was initiated by Microsoft with sponsorship from the bank First USA. The concept was that Garry Kasparov as White would play the rest of the world on the Web: one ply would be played per day and the World Team was to vote for its move. The Kasparov-World game was a success from many points of view. It certainly gave thousands the feeling of facing the world’s best player across the board and did much for the future of the game. Described by Kasparov as “phenomenal ... the most complex in chess history”, it is probably a worthy ‘Greatest Game’ candidate. Computer technology has given chess a new mode of play and taken it to new heights: the experiment deserves to be repeated. We look forward to another game and experience of this quality although it will be difficult to surpass the event we have just enjoyed. We salute and thank all those who contributed - sponsors, moderator, coaches, unofficial analysts, organisers, technologists, voters and our new friends.

Concord Grape Juice, cognitive function and driving performance: a 12 week, placebo controlled, randomised, crossover trial in mothers of pre-teen children

Background: Daily consumption of Concord grape juice (CGJ) over three to four months has been shown to improve memory function in adults with mild cognitive impairment, and reduce blood pressure in hypertensive adults. These benefits are likely due to the high concentration of polyphenols in CGJ. Increased stress can impair cognitive function and elevate blood pressure. Thus we examined the potential beneficial effect of CGJ in individuals experiencing somewhat stressful demanding lifestyles. Objective: To examine the effects of twelve weeks’ daily consumption of CGJ on cognitive function, driving performance, and blood pressure in healthy, middle-aged working mothers. Design: Twenty five healthy mothers of pre-teen children, aged 40-50 years, who were employed for > 30 hours/week consumed 12oz (355ml) CGJ (containing 777mg total polyphenols) or an energy, taste and appearance matched placebo daily for twelve weeks according to a randomised, crossover design with a four week washout. Verbal and spatial memory, executive function, attention, blood pressure and mood were assessed at baseline, six weeks and twelve weeks. Immediately following the cognitive battery, a subsample of seventeen females completed a driving performance assessment in the University of Leeds Driving Simulator. The twenty five minute driving task required participants to match the speed and direction of a lead vehicle. Results: Significant improvements in immediate spatial memory and driving performance were observed following CGJ relative to placebo. There was evidence of an enduring effect of CGJ such that participants who received CGJ in arm 1 maintained better performance in the placebo arm. Conclusions: Cognitive benefits associated with chronic consumption of flavonoid-rich grape juice are not exclusive to adults with mild cognitive impairment. Moreover, these cognitive benefits are apparent in complex everyday tasks such as driving. Effects may persist beyond cessation of flavonoid consumption and future studies should carefully consider the length of washout within crossover designs.

The multiple team formation problem using sociometry

The Team Formation problem (TFP) has become a well-known problem in the OR literature over the last few years. In this problem, the allocation of multiple individuals that match a required set of skills as a group must be chosen to maximise one or several social positive attributes. Speci�cally, the aim of the current research is two-fold. First, two new dimensions of the TFP are added by considering multiple projects and fractions of people's dedication. This new problem is named the Multiple Team Formation Problem (MTFP). Second, an optimization model consisting in a quadratic objective function, linear constraints and integer variables is proposed for the problem. The optimization model is solved by three algorithms: a Constraint Programming approach provided by a commercial solver, a Local Search heuristic and a Variable Neighbourhood Search metaheuristic. These three algorithms constitute the first attempt to solve the MTFP, being a variable neighbourhood local search metaheuristic the most effi�cient in almost all cases. Applications of this problem commonly appear in real-life situations, particularly with the current and ongoing development of social network analysis. Therefore, this work opens multiple paths for future research.