Nick Wedd | 28 Oct 10:30 2014
Picon

November KGS bot tournament: 19x19

The November KGS bot tournament will be held on Sunday November 16th,
starting at 11:00 UTC and ending at 19:00 UTC.  It will use 19x19
boards,  with time limits of 14 minutes each plus very fast Canadian
overtime, and komi of 7.5.  There are details at
http://www.gokgs.com/tournInfo.jsp?id=930 .

I will be on holiday at the time. This is the reason for the
non-standard start time. It also means that from a few days before the
event, I will not have access to my usual email address from which I am
posting this, so you will need to use maproom <at> gmail.com to register.

Please register by emailing me, with the words
"KGS Tournament Registration" in the email title, at
maproom <at> gmail.com .

Nick
--

-- 
Nick Wedd
nick <at> maproom.co.uk
"Ingo Althöfer" | 27 Oct 12:31 2014
Picon
Picon

codecentric Challenge

Hi Rémi,

> Thanks Ingo. I enjoyed this match very much.

The same did I.
It was so nice that both you and FJ were so easy-going
during the arrangements.

By the way, it was a lucky coincidence that the event 
became real in 2014. In German computer go forum there
was a discussion on the Yoda exhibition games from March 
2014, where CrazyStone hadhad a nice H4-win.

FJ also participated, and out of the blue he wrote
"I would be willing to play some match against CS
when someone is willing to sponsor that". For a moment
we discussed crowd funding via the forum, but than I
had an idea which turned out to be better. Raymond-Georg
Snatzke was my assistant at Jena University. He got a
doctor degree for a thesis on Combinatorial Game Theory
applied to the game of Amazons. For several years he is 
now with codecentric. 
I told Georg about FJ's idea to have a match with sponsor.
Georg asked his boss, and to his surprise the answer
was directly positive. 

For me the match is one (little) step on the long march:
to have a bot beating a top human player without handicap
by 2027 (the year of my retirement from University job).

(Continue reading)

"Ingo Althöfer" | 27 Oct 11:13 2014
Picon
Picon

codecentric Challenge

Hello,

it seems that currently the mails from this list are not
properly distributed, at least I did not receive the two 
mails on zombie processes.

Nevertheless, I found them in the archive. Here are some
replies:

Nick Wedd wrote:
> Yesterday F J Dickhut won his game in the "codecentric 
> go challenge 2014" five-game match against Crazy Stone, 
> bringing the score to 3-1, and winning the match. 
> My congratulations to Franz Dickhut!  

Congratulations also from me to Franz-Josef. He fully
deserves the win (and the prize money). It was interesting
to see his learning process: From round to round he
had CrazyStone better under control.

> I hope such an event will be held again next year.

It is my intention to organize a similar event in Fall 2015,
with a top German amateur player and a top computer
program.

On the zombie processes: It is sort of a miracle for me
that Remi did not realize the "double load" quickly.
Normally the bot is showing its simulation count all
the time, and smaller numbers should be recognized
(Continue reading)

Nick Wedd | 26 Oct 11:30 2014
Picon

Zombie processes

Yesterday F J Dickhut won his game in the "codecentric go challenge
2014" five-game match against Crazy Stone, bringing the score to 3-1,
and winning the match. My congratulations to Franz Dickhut!  I hope
such an event will be held again next year.

I have just read a posting by 'leichtloeslich' at
http://www.lifein19x19.com/forum/viewtopic.php?f=9&t=10890&p=175108#p175108
which reads

 > Crazystone had several disconnections during the game.
 >
 > After the first disconnect (and subsequent reconnect), appearently
 > a second instance of Crazystone was running in the background (I
 > think all the way till the second disconnect, you can read about this
 > in the KGS kibitz from the end of the game), so that for about 1/3 of
 > the game Crazystone was running on merely half the processing
 > power/memory it should have been able to use.

I have come across a similar problem before. In the 2010 European Go
Congress, I was sent a copy of Leela to operate. It had a few
disconnects (after which I simply restarted it), but did badly, losing
all its games.  At the end of the event, when I shut down the machine it 
had been using, I found multiple copies of Leela running, which
would all have been competing for resources.

I wonder how practicable it would be for a bot, on startup, to search
for other copies of itself running, and issue a warning if it finds any.

Nick
--

-- 
(Continue reading)

Peter Drake | 24 Oct 21:51 2014

Re: Definition of single-point eye

I think I'll be doing exactly this: it's alive if it can never be captured; [some example] is alive because it has two eyes.

(In my flyer sequence, I will cover false eyes and seki, but not bent four or thousand-year Ko.)


On Fri, Oct 24, 2014 at 9:23 AM, Dave Dyer <ddyer <at> real-me.net> wrote:

I agree with the idea that focusing on life, rather than eyes, is
the most intuitive.  Then you can explain everything with a few
simple statements.

1) a group is captured if there are not empty spaces adjavcent to it.
2) a group is alive if no sequence of legal moves can capture it.

then you should simple examples of groups that are alive.  As a side
comment, you might mention that there are lots of unusual and tricky
cases, where the "rules" clause gets complicated - Starting with false
eyes, and sekis, bent four in the corner, and thousand year Ko.


_______________________________________________
Computer-go mailing list
Computer-go <at> dvandva.org
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go



--
Peter Drake
https://sites.google.com/a/lclark.edu/drake/
_______________________________________________
Computer-go mailing list
Computer-go <at> dvandva.org
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
Dave Dyer | 24 Oct 18:23 2014
Picon

Re: Definition of single-point eye


I agree with the idea that focusing on life, rather than eyes, is
the most intuitive.  Then you can explain everything with a few
simple statements.

1) a group is captured if there are not empty spaces adjavcent to it.
2) a group is alive if no sequence of legal moves can capture it.

then you should simple examples of groups that are alive.  As a side
comment, you might mention that there are lots of unusual and tricky
cases, where the "rules" clause gets complicated - Starting with false
eyes, and sekis, bent four in the corner, and thousand year Ko.
Dave Dyer | 24 Oct 18:23 2014
Picon

Re: Definition of single-point eye


I agree with the idea that focusing on life, rather than eyes, is
the most intuitive.  Then you can explain everything with a few
simple statements.

1) a group is captured if there are not empty spaces adjavcent to it.
2) a group is alive if no sequence of legal moves can capture it.

then you should simple examples of groups that are alive.  As a side
comment, you might mention that there are lots of unusual and tricky
cases, where the "rules" clause gets complicated - Starting with false
eyes, and sekis, bent four in the corner, and thousand year Ko.
Peter Drake | 24 Oct 00:17 2014

Definition of single-point eye

I'm writing up some "how to play Go" flyers and and want to make sure I'm being precise. How is this for a definition of a [single-point] eye?

An eye is a vacant point, surrounded [orthogonally] by stones of the same color, that can only be filled by simultaneously capturing all of the surrounding stones.

Note that this is a "real" eye, not a "pseudo" or "quasi" eye as we often use in Monte Carlo search.

Also, because these are rules for beginners, I'm only interested in one-point eyes. Under AGA (and, I think, Chinese) rules, confused players can always keep going until all eyes are one-point eyes.

I *think* this definition works regardless of whether adjacent blocks have one or two eyes. (If filling is always illegal, it certainly requires capturing all of the surrounding stones.)

Is there a horrible flaw in my definition?

--
Peter Drake
https://sites.google.com/a/lclark.edu/drake/
_______________________________________________
Computer-go mailing list
Computer-go <at> dvandva.org
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
Winands M (DKE | 23 Oct 14:44 2014
Picon

Ph.D. Position on Learning Online Search-Control Knowledge for General Game Playing (Maastricht University, NL)

+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

Ph.D. Vacancy on Learning Online Search-Control Knowledge for General Game Playing

The Department of Knowledge Engineering (DKE), of the Faculty of Humanities and Sciences (FHS), has a
vacancy for a Ph.D. Researcher on the GoGeneral project funded by NWO and DKE. The project, supervised by
dr. Mark Winands (Maastricht University) and prof. dr. Yngvi Björnsson (Reykjavik University), aims
to create intelligent programs that can automatically learn how to play many different games at an expert
level without any human intervention. 

The domain of General Game Playing (GGP) poses many research challenges in several areas of Artificial
Intelligence, such as knowledge acquisition, heuristic search, and machine learning. A recent
development in GGP is the successful application of simulation-based search methods such as
Monte-Carlo Tree Search and Nested Monte-Carlo Search. These search methods overcome to some extent the
knowledge-acquisition bottleneck. Still, all relevant search-control knowledge required for
expert-level play must be discovered using machine-learning techniques during online play. This is a
challenging task, for which more effective methods are required than currently exist. Therefore, this
project aims to develop new and more methods for online learning of search control, which will lead to
improved search algorithms. 

++++ REQUIREMENTS

Successful candidates are expected to meet the following requirements:

- A M.Sc. degree in Computer Science, Artificial Intelligence, Knowledge Engineering, or Applied
Mathematics. Candidates expecting to graduate by 1 February 2015 can also apply.
- Proof of excellence and ambition.
- An enthusiastic and cooperative working attitude.
- Perseverance to meet the targets that are set.
- Good communicative skills.
- A strong background in programming.

Preferred skills are as follows:

- Experience with C++ or Java.
- Strong self-motivation and drive.
- Fluency in English.

++++ CONDITIONS OF EMPLOYMENT

-  PhD position for four years (full time, 38 hrs/week, yearly evaluation)
-  Gross salary ranging from Euro 2083 (1st year) to Euro 2664 (4th year) gross per month
-  Holiday allowance (8%), end-of-year bonus (8.3%)
-  Stimulating scientific environment
-  Excellent facilities for professional and personal development

++++ ORGANISATION: MAASTRICHT UNIVERSITY (UM) and  DEPARTMENT OF KNOWLEDGE ENGINEERING (DKE)

UM (www.maastrichtuniversity.nl) is renowned for its unique, innovative, problem-based learning
system, which is characterized by a small-scale and student-oriented approach. Research at UM is
characterized by a multidisciplinary and thematic approach, and is concentrated in research
institutes and schools. Maastricht University has around 16,000 students and 4,000 employees.
Reflecting the university's strong international profile, a fair number of both students and staff are
from abroad. The university hosts 6 faculties: Faculty of Health, Medicine and Life Sciences, Faculty of
Law, School of Business and Economics, Faculty of Humanities and Sciences, Faculty of Arts and Social
Sciences, Faculty of Psychology and Neuroscience.

Founded in 1992 as part of the Faculty of Humanities and Sciences, today DKE
(www.maastrichtuniversity.nl/web/Schools/DKE.htm) broadly covers Knowledge Engineering in
research and teaching. DKE comprises three internationally respected research groups, having their
foci on "Robotics, Agents and Interaction", "Networks and Strategic Optimization", and
"Biomathematics and Bioinformatics". Education programs currently offered by DKE are Knowledge
Engineering (Bachelor), Artificial Intelligence and Operations Research (both Master). DKE has been
top-ranked in Keuzegids Hoger Onderwijs (2014). With respect to both research and teaching DKE is
engaged in various national and international collaborations.

++++ FURTHER INFORMATION AND HOW TO APPLY

Informal inquiries concerning this position can be directed to dr. Mark Winands (m.winands_at_maastrichtuniversity.nl).

Applicants are asked to email a curriculum vitae and the name of at least one reference to 
Recruitmentfhs <at> maastrichtuniversity.nl with relevant vacancy number (AT2014.201) in the subject
line before 1-12-2014. 

+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Nick Wedd | 22 Oct 14:13 2014
Picon

Date of November KGS bot tournament

At present, the  November KGS bot tournament is scheduled for Sunday
November 9th, starting at 08:00 UTC.  Hideki Kato has pointed out to me
that this clashes with the Game Programming Workshop 2014 (GPW-14) on
November 7th-9th, making it difficult for Japanese programmers to
enter. I therefore propose postponing it to November 16th, starting at
11:00 UTC, and probably ending at 17:00 UTC (I will be on holiday with
friends, making a start at 08:00 UTC difficult for me).

If any of you are planning to enter but find this date impossible,
please let me know soon, and I will try to find a better date.

Nick
--

-- 
Nick Wedd
nick <at> maproom.co.uk
Nick Wedd | 13 Oct 17:10 2014
Picon

Congratulations to Fuego!

Congratulations to Fuego9, winner of yesterday's KGS bot tournament!

The results are at http://www.weddslist.com/kgs/past/106/index.html
and as usual I welcome your corrections and comments.

Nick
--

-- 
Nick Wedd
nick <at> maproom.co.uk

Gmane