<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Games Research</title>
	<atom:link href="http://www.barneypell.com/games-research/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.barneypell.com</link>
	<description></description>
	<lastBuildDate>Fri, 07 May 2010 13:32:55 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
	<item>
		<title>By: David Dowe</title>
		<link>http://www.barneypell.com/games-research/comment-page-1/#comment-1369</link>
		<dc:creator>David Dowe</dc:creator>
		<pubDate>Fri, 07 May 2010 13:32:55 +0000</pubDate>
		<guid isPermaLink="false">http://174.120.172.92/~barneype/?page_id=139#comment-1369</guid>
		<description>Subject: Wallace chess-like game where both sides move simultaneously

Hi, Barney.

I&#039;m not sure whether you know of Chris Wallace (1933-2004), the originator of Minimum Message Length (MML) [in Wallace &amp; Boulton, 1968], 10 years and many papers before certain rival methods.  In Sept 2008 (Vol. 51, No. 5), the Computer Journal (Oxford U Press) ran a
Christopher Stewart WALLACE (1933-2004) memorial special issue
[http://comjnl.oxfordjournals.org/content/vol51/issue5]
paying tribute to his work in a vast range of areas - MML, fast multiplication,
random number generation, etc.

In my D. L. Dowe (2008a) ``Foreword re C. S. Wallace&#039;&#039; (pp523-560)
www.csse.monash.edu.au/~dld/David.Dowe.publications.html#Dowe2008a
as guest editor of this special issue, in footnote 51 (sec. 0.2.2, pp526-527)
I mention a chess-like game of Wallace&#039;s in which both sides move(d) simultaneously.

It would be great to see this game implemented in code and played.

As the abovementioned Computer J special attests to, I am far from
alone in believing that Wallace would have been a more than deserving
Turing award recipient.


Best,

David Dowe.

http://comjnl.oxfordjournals.org/content/vol51/issue5
www.csse.monash.edu.au/~dld/David.Dowe.publications.html#Dowe2008a</description>
		<content:encoded><![CDATA[<p>Subject: Wallace chess-like game where both sides move simultaneously</p>
<p>Hi, Barney.</p>
<p>I&#8217;m not sure whether you know of Chris Wallace (1933-2004), the originator of Minimum Message Length (MML) [in Wallace &amp; Boulton, 1968], 10 years and many papers before certain rival methods.  In Sept 2008 (Vol. 51, No. 5), the Computer Journal (Oxford U Press) ran a<br />
Christopher Stewart WALLACE (1933-2004) memorial special issue<br />
[http://comjnl.oxfordjournals.org/content/vol51/issue5]<br />
paying tribute to his work in a vast range of areas &#8211; MML, fast multiplication,<br />
random number generation, etc.</p>
<p>In my D. L. Dowe (2008a) &#8220;Foreword re C. S. Wallace&#8221; (pp523-560)<br />
<a href="http://www.csse.monash.edu.au/~dld/David.Dowe.publications.html#Dowe2008a" rel="nofollow">http://www.csse.monash.edu.au/~dld/David.Dowe.publications.html#Dowe2008a</a><br />
as guest editor of this special issue, in footnote 51 (sec. 0.2.2, pp526-527)<br />
I mention a chess-like game of Wallace&#8217;s in which both sides move(d) simultaneously.</p>
<p>It would be great to see this game implemented in code and played.</p>
<p>As the abovementioned Computer J special attests to, I am far from<br />
alone in believing that Wallace would have been a more than deserving<br />
Turing award recipient.</p>
<p>Best,</p>
<p>David Dowe.</p>
<p><a href="http://comjnl.oxfordjournals.org/content/vol51/issue5" rel="nofollow">http://comjnl.oxfordjournals.org/content/vol51/issue5</a><br />
<a href="http://www.csse.monash.edu.au/~dld/David.Dowe.publications.html#Dowe2008a" rel="nofollow">http://www.csse.monash.edu.au/~dld/David.Dowe.publications.html#Dowe2008a</a></p>
]]></content:encoded>
	</item>
</channel>
</rss>
