
I'd seen the in game chess, and wondered if Go could be done.
If anyone thinks they could accomplish this, please contact me with details, as I'd be glad to hire you.
Thanks

These forums are CLOSED. Please visit the new forums HERE
Looking to hire a scripter... |
|
Aurens Czukor
Waster of Prims
![]() Join date: 3 Oct 2004
Posts: 60
|
10-18-2004 22:42
I had an idea for an in-game working version of the Japanese board game 'Go', but I have no scripiting skills at all
![]() I'd seen the in game chess, and wondered if Go could be done. If anyone thinks they could accomplish this, please contact me with details, as I'd be glad to hire you. Thanks ![]() _____________________
t('.' t) t('.' t) t('.' t) t('.' t) t('.' t) t('.' t) t('.' t) t('.' t) t('.' t)
... Kirby does not like you. |
Kurt Zidane
Just Human
Join date: 1 Apr 2004
Posts: 636
|
10-19-2004 01:45
lol! I was thinking about this the other day..
|
Ardith Mifflin
Mecha Fiend
Join date: 5 Jun 2004
Posts: 1,416
|
10-19-2004 04:08
I seem to recall some people working on a Go board in the past, though I can't remember any names. You may not need to reinvent the wheel. Try searching the forums for Go, and maybe you'll find what you need.
Edit: Except the forums won't let you search for go. Sorry. Maybe someone with a better memory will chime in. |
Kurt Zidane
Just Human
Join date: 1 Apr 2004
Posts: 636
|
10-19-2004 11:50
I could write a simple program in a less then an hour. Simple being able place stones of the appropriate color, but no rules or logic.
For a more complex program. I've been thinking about what tasks would need to be accomplished. Like Mapping stone input into the mane script. I think I could create a list of all object labeled stone in a link set. And then Sort the list by positive y to negative y, in order. And then resort the list by sorting each set of same y by negative x to positive x. If the list also contained the number of the link set. Then the list would be a map of the table. I just haven't figured out how to detect witch object in the link set was clicked. With out having each object have a touch script. I wouldn't want to have that many scripts, if I didn't have to. It's already pretty bad to think how many objects go would require. I've thought about creating object, but then that's allot of lissons. Creating them in a link set could be possible. But then there isn't a way to detect where a user tries to place a stone. Detecting zones could be figured out by a temporary matrix, and then simulating a paint bucket effect to detect who has control of witch area. But it quickly gets complicated. |
Aurens Czukor
Waster of Prims
![]() Join date: 3 Oct 2004
Posts: 60
|
10-19-2004 15:56
That entire post was in Greek to me
![]() That's exactly why I'm looking to hire a scripter to do this for me. If anyone thinks they can pull it off, let me know and we'll talk price ![]() _____________________
t('.' t) t('.' t) t('.' t) t('.' t) t('.' t) t('.' t) t('.' t) t('.' t) t('.' t)
... Kirby does not like you. |
MSo Lambert
Registered User
Join date: 16 Aug 2004
Posts: 101
|
10-19-2004 16:04
Although the idea is very interesting, my todo list is currently too big for this kind of project (whose isn't lol), but in reply to Kurt's post -- you might want to take a look at llDetectedLinkNumber function.
_____________________
MSo
|
Francis Chung
This sentence no verb.
![]() Join date: 22 Sep 2003
Posts: 918
|
10-19-2004 16:12
There used to be a thread where people would advertise their willingess to help out with others with scripting stuffs. Maybe it needs a bump?
/54/ba/17223/1.html As far as GO goes, the AI folks tell me it's one of the hardest general problems to solve. (Much harder than chess) Apparently the search space for next moves is incredibly huge. I'm sure any scripter can make a simple board. A more interesting challenge would be to have it keep score. I wonder if anyone in SL has talent to make a strong AI, though ![]() _____________________
--
~If you lived here, you would be home by now~ |
LordJason Kiesler
imperfection inventor.
![]() Join date: 30 May 2004
Posts: 215
|
Computers and Go
10-19-2004 19:26
Although attempts have been made to program computers to play Go, success in that area has been moderate at best - development in this area has not reached the level of Chess programs. Even the strongest programs are no better than an average club player, and would easily be beaten by a strong player even getting a nine-stone handicap. This is attributed to many qualities of the game, including the "optimising" nature of the victory condition, the virtually unlimited placement of each stone, the large board size, the nonlocal nature of the Ko rule, and the high degree of pattern recognition involved. For this reason, many in the field of artificial intelligence consider Go to be a better measure of a computer's capacity for thought than chess. See the article on Computer Go for details.
Quote from - http://en.wikipedia.org/wiki/Go_(board_game)#Basic_rules . _____________________
"no, my alt is clean on crashing any sims"
|