Account Options

  1. Sign in
The old Google Groups will be going away soon, but your browser is incompatible with the new version.
Google Groups Home
« Groups Home
comp.lang.lisp
+ new post
About this group
Subscribe to this group
This is a Usenet group - learn more
Message from discussion Trisoli, a puzzle game
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
 
From:
To:
Cc:
Followup To:
Add Cc | Add Followup-to | Edit Subject
Subject:
Validation:
For verification purposes please type the characters you see in the picture below or the numbers you hear by clicking the accessibility icon. Listen and type the numbers you hear
 
Frank Buss  
View profile  
 More options Dec 26 2005, 8:51 pm
Newsgroups: comp.lang.lisp
From: Frank Buss <f...@frank-buss.de>
Date: Tue, 27 Dec 2005 02:51:58 +0100
Local: Mon, Dec 26 2005 8:51 pm
Subject: Re: Trisoli, a puzzle game
Print | View thread | Show original | Report this message | Find messages by this author

Marcin 'Qrczak' Kowalczyk wrote:
> It's essentially the same algorithm.

yes, it's both a breadth-first-search (BFS), but your solution is shorter
and more functional programming style with some interesting mapping
contructs.

BTW: I've spent one hour yesterday for a depth-first-search, until I
realized that it is too slow, then another one to rewrite it to a BFS and a
last hour trying to find a bug in the program, because it didn't found a
solution for the impossible target board setup :-)

--
Frank Buß, f...@frank-buss.de
http://www.frank-buss.de, http://www.it4-systems.de


 
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
Create a group - Google Groups - Google Home - Terms of Service - Privacy Policy
©2013 Google